Borderou de evaluare (job #953106)

Utilizator narcis_vsGemene Narcis - Gabriel narcis_vs Data 24 mai 2013 21:42:50
Problema Distincte Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: user.cpp: In function ‘void Citire()’: user.cpp:39:9: error: reference to ‘prev’ is ambiguous prev[a[i]] = N+1; ^ user.cpp:26:5: note: candidates are: int prev [100010] int prev[Nmax];//prev[i] = cea mai din drepta pozitie aflata in stanga lui v[i] la pasul k ^ In file included from /usr/local/include/c++/4.8.0/bits/stl_algobase.h:66:0, from /usr/local/include/c++/4.8.0/bits/char_traits.h:39, from /usr/local/include/c++/4.8.0/ios:40, from /usr/local/include/c++/4.8.0/istream:38, from /usr/local/include/c++/4.8.0/fstream:38, from user.cpp:1: /usr/local/include/c++/4.8.0/bits/stl_iterator_base_funcs.h:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type) prev(_BidirectionalIterator __x, typename ^ user.cpp: In function ‘void Rezolvare()’: user.cpp:77:20: error: reference to ‘prev’ is ambiguous Update(prev[a[k]],-a[k]);//scot din aib pe a[k] daca acesta mai apare odata la pasii precedenti ^ user.cpp:26:5: note: candidates are: int prev [100010] int prev[Nmax];//prev[i] = cea mai din drepta pozitie aflata in stanga lui v[i] la pasul k ^ In file included from /usr/local/include/c++/4.8.0/bits/stl_algobase.h:66:0, from /usr/local/include/c++/4.8.0/bits/char_traits.h:39, from /usr/local/include/c++/4.8.0/ios:40, from /usr/local/include/c++/4.8.0/istream:38, from /usr/local/include/c++/4.8.0/fstream:38, from user.cpp:1: /usr/local/include/c++/4.8.0/bits/stl_iterator_base_funcs.h:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type) prev(_BidirectionalIterator __x, typename ^ user.cpp:79:13: error: reference to ‘prev’ is ambiguous prev[a[k]] = k; ^ user.cpp:26:5: note: candidates are: int prev [100010] int prev[Nmax];//prev[i] = cea mai din drepta pozitie aflata in stanga lui v[i] la pasul k ^ In file included from /usr/local/include/c++/4.8.0/bits/stl_algobase.h:66:0, from /usr/local/include/c++/4.8.0/bits/char_traits.h:39, from /usr/local/include/c++/4.8.0/ios:40, from /usr/local/include/c++/4.8.0/istream:38, from /usr/local/include/c++/4.8.0/fstream:38, from user.cpp:1: /usr/local/include/c++/4.8.0/bits/stl_iterator_base_funcs.h:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type) prev(_BidirectionalIterator __x, typename ^

Ceva nu functioneaza?