Rezumat problemă

smax

#1734

Un muzeu al diamantelor își are sediul într-o clădire cu formă cubică cu N etaje, numerotate de la 1 la N. În fiecare camera se află un diamant cu valoarea cunoscută. Niște hoți vor sa fure diamantele si trebuie să aleagă cel mai profitabil traseu care să pornească din camera cu eticheta 1 1 1 și să ajungă în camera cu eticheta N N N și care, bineînțeles, să le permită să obțină o sumă maximă din vânzarea diamantelor furate din camerele prin care au trecut în traseu ales.

Concursul Național de Soft Grigore Moisil - Lugoj, 2016

Fișiere Minca Carmen (carmen) Carmen Minca concurs

Clasa 11 Programare dinamică Probleme diverse de programare dinamică

Rezolvă

Detalii

Problema	smax	Operații I/O	smax.in/smax.out
Limita timp	0.2 secunde	Limita memorie	Total: 6 MB / Stivă 6 MB
Id soluție	#56217690	Utilizator	Zamfirescu Mario (Zamfirescu)
Fișier	smax.cpp	Dimensiune	749 B
Data încărcării	10 Februarie 2025, 19:17	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

smax.cpp: In function 'int main()':
smax.cpp:26:81: error: no matching function for call to 'max(short int&, int)'
                 r[k][i][j] = max(max(max(r[k][i][j], v[k][i][j] + r[k + 1][i][j]), v[k][i][j] + r[k][i + 1][j]), v[k][i][j] + r[k][i][j + 1]);

                                                                                 ^
smax.cpp:26:81: 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 smax.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:
smax.cpp:26:81: note:   deduced conflicting types for parameter 'const _Tp' ('short int' and 'int')
                 r[k][i][j] = max(max(max(r[k][i][j], v[k][i][j] + r[k + 1][i][j]), v[k][i][j] + r[k][i + 1][j]), v[k][i][j] + r[k][i][j + 1]);

                                                                                 ^
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 smax.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:
smax.cpp:26:81: note:   deduced conflicting types for parameter 'const _Tp' ('short int' and 'int')
                 r[k][i][j] = max(max(max(r[k][i][j], v[k][i][j] + r[k + 1][i][j]), v[k][i][j] + r[k][i + 1][j]), v[k][i][j] + r[k][i][j + 1]);

                                                                                 ^
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 smax.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:
smax.cpp:26:81: note:   mismatched types 'std::initializer_list<_Tp>' and 'short int'
                 r[k][i][j] = max(max(max(r[k][i][j], v[k][i][j] + r[k + 1][i][j]), v[k][i][j] + r[k][i + 1][j]), v[k][i][j] + r[k][i][j + 1]);

                                                                                 ^
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 smax.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:
smax.cpp:26:81: note:   mismatched types 'std::initializer_list<_Tp>' and 'short int'
                 r[k][i][j] = max(max(max(r[k][i][j], v[k][i][j] + r[k + 1][i][j]), v[k][i][j] + r[k][i + 1][j]), v[k][i][j] + r[k][i][j + 1]);

                                                                                 ^

Cum funcționează evaluarea?