Borderou de evaluare (job #2503382)
Utilizator | Data | 2 decembrie 2019 22:45:51 | |
---|---|---|---|
Problema | Text3 | Status | done |
Runda | Arhiva de probleme | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In function 'void Recompute_Sol(int)':
main.cpp:26:23: error: reference to 'prev' is ambiguous
Recompute_Sol(prev[p]);
^~~~
main.cpp:14:8: note: candidates are: int prev [20005]
int N, prev[NMAX], max_len[NMAX], dp[30], l_maxim, pivot;
^~~~
In file included from /usr/include/c++/6/bits/stl_algobase.h:66:0,
from /usr/include/c++/6/bits/char_traits.h:39,
from /usr/include/c++/6/ios:40,
from /usr/include/c++/6/istream:38,
from /usr/include/c++/6/fstream:38,
from main.cpp:1:
/usr/include/c++/6/bits/stl_iterator_base_funcs.h:217:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
prev(_BidirectionalIterator __x, typename
^~~~
main.cpp: In function 'void Solve_Dynamic()':
main.cpp:38:61: error: reference to 'prev' is ambiguous
max_len[i] = max_len[dp[words[i][0] - 96]] + 1, prev[i] = dp[words[i][0] - 96];
^~~~
main.cpp:14:8: note: candidates are: int prev [20005]
int N, prev[NMAX], max_len[NMAX], dp[30], l_maxim, pivot;
^~~~
In file included from /usr/include/c++/6/bits/stl_algobase.h:66:0,
from /usr/include/c++/6/bits/char_traits.h:39,
from /usr/include/c++/6/ios:40,
from /usr/include/c++/6/istream:38,
from /usr/include/c++/6/fstream:38,
from main.cpp:1:
/usr/include/c++/6/bits/stl_iterator_base_funcs.h:217:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
prev(_BidirectionalIterator __x, typename
^~~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !