Borderou de evaluare (job #998436)
| Utilizator |  Mihai Ionut Enache Mihai22e |
Data | 16 septembrie 2013 23:57:15 |
|---|---|---|---|
| Problema | Subsir crescator maximal | Status | done |
| Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
| Scor | 0 | ||
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘int main()’:
user.cpp:57:32: error: reference to ‘prev’ is ambiguous
best[i] = best[p] + 1, prev[i] = p;
^
user.cpp:8:28: note: candidates are: int prev [100002]
int v[MAX_N], best[MAX_N], prev[MAX_N], A[MAX_N], a[MAX_N], D[MAX_N], sol[MAX_N];
^
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:67:16: error: reference to ‘prev’ is ambiguous
temp = prev[temp];
^
user.cpp:8:28: note: candidates are: int prev [100002]
int v[MAX_N], best[MAX_N], prev[MAX_N], A[MAX_N], a[MAX_N], D[MAX_N], sol[MAX_N];
^
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?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !
