Rezumat problemă

BoB

#3511

Bob deține n boabe, pentru fiecare știindu-se greutatea și prețul. Venind perioada festivalelor, acesta are nevoie de bani. Astfel, s-a gândit că ar trebui să vândă câteva din ele. Acesta va roagă să determinați suma maximă pe care o poate obține, știind că greutățile boabelor vândute trebuie să formeze un subsir strict crescător.

Consola Moca Andrei (TREYWAY) Andrei Moca dificilă

Clasa 11 Programare dinamică Probleme diverse de programare dinamică

Rezolvă

Detalii

Problema	BoB	Operații I/O	tastatură/ecran
Limita timp	0.1 secunde	Limita memorie	Total: 50 MB / Stivă 5 MB
Id soluție	#61810765	Utilizator	Condorache Tudor (EuSuntTudor)
Fișier	bob.cpp	Dimensiune	1.55 KB
Data încărcării	10 Decembrie 2025, 21:01	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

bob.cpp: In function 'void update(int, int, int, int, int)':
bob.cpp:27:38: error: no matching function for call to 'max(long long int&, int&)'
       aint[node] = max(aint[node],val);

                                      ^
bob.cpp:27:38: note: candidates are:
In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/sstream:38,
                 from /usr/include/c++/4.8/complex:45,
                 from /usr/include/c++/4.8/ccomplex:38,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52,
                 from bob.cpp:1:
/usr/include/c++/4.8/bits/stl_algobase.h:216:5: note: template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)
     max(const _Tp& __a, const _Tp& __b)
     ^
/usr/include/c++/4.8/bits/stl_algobase.h:216:5: note:   template argument deduction/substitution failed:
bob.cpp:27:38: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
       aint[node] = max(aint[node],val);

                                      ^
In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/sstream:38,
                 from /usr/include/c++/4.8/complex:45,
                 from /usr/include/c++/4.8/ccomplex:38,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52,
                 from bob.cpp:1:
/usr/include/c++/4.8/bits/stl_algobase.h:260:5: note: template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)
     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
     ^
/usr/include/c++/4.8/bits/stl_algobase.h:260:5: note:   template argument deduction/substitution failed:
bob.cpp:27:38: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
       aint[node] = max(aint[node],val);

                                      ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from bob.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:4231:5: note: template<class _Tp> _Tp std::max(std::initializer_list<_Tp>)
     max(initializer_list<_Tp> __l)
     ^
/usr/include/c++/4.8/bits/stl_algo.h:4231:5: note:   template argument deduction/substitution failed:
bob.cpp:27:38: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
       aint[node] = max(aint[node],val);

                                      ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from bob.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:4236:5: note: template<class _Tp, class _Compare> _Tp std::max(std::initializer_list<_Tp>, _Compare)
     max(initializer_list<_Tp> __l, _Compare __comp)
     ^
/usr/include/c++/4.8/bits/stl_algo.h:4236:5: note:   template argument deduction/substitution failed:
bob.cpp:27:38: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
       aint[node] = max(aint[node],val);

                                      ^

Cum funcționează evaluarea?