Rezumat problemă

SecvMax

#166

Să se determine cea mai lungă secvență de elemente pare dintr-un vector.

Fișiere Candale Silviu (silviu) medie

Clasa 9 Tablouri unidimensionale (vectori) Probleme cu secvențe

Rezolvă

Detalii

Problema	SecvMax	Operații I/O	secvmax.in/secvmax.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#20051139	Utilizator	Langa Radu (langa_b)
Fișier	secvmax.cpp	Dimensiune	716 B
Data încărcării	16 Ianuarie 2020, 21:52	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

secvmax.cpp: In function 'int main()':
secvmax.cpp:15:8: error: reference to 'max' is ambiguous
    if (max <= contor) {

        ^
secvmax.cpp:3:61: note: candidates are: long long int max
 long long x[10000], n, i, j, k, contor = 0, a1 = 0, b1 = 0, max = 0, s = 0, smax=0, a0, b0, smax1;

                                                             ^
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/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from secvmax.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:216:5: note:                 template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)
     max(const _Tp& __a, const _Tp& __b)
     ^
secvmax.cpp:20:5: error: reference to 'max' is ambiguous
     max = contor;

     ^
secvmax.cpp:3:61: note: candidates are: long long int max
 long long x[10000], n, i, j, k, contor = 0, a1 = 0, b1 = 0, max = 0, s = 0, smax=0, a0, b0, smax1;

                                                             ^
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/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from secvmax.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:216:5: note:                 template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)
     max(const _Tp& __a, const _Tp& __b)
     ^
secvmax.cpp:28:8: error: reference to 'max' is ambiguous
    if (max == contor) {

        ^
secvmax.cpp:3:61: note: candidates are: long long int max
 long long x[10000], n, i, j, k, contor = 0, a1 = 0, b1 = 0, max = 0, s = 0, smax=0, a0, b0, smax1;

                                                             ^
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/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from secvmax.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:216:5: note:                 template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)
     max(const _Tp& __a, const _Tp& __b)
     ^

Cum funcționează evaluarea?