Borderou de evaluare (job #2592303)
| Utilizator |  Dragutoiu Vlad-Ioan levladiator |
Data | 1 aprilie 2020 15:50:28 |
|---|---|---|---|
| Problema | Secvmin | Status | done |
| Runda | Arhiva de probleme | Compilator | cpp-64 | Vezi sursa |
| Scor | 0 | ||
Raport evaluator
Eroare de compilare:
main.cpp: In function 'int main()':
main.cpp:21:9: error: reference to 'prev' is ambiguous
prev[b[i]]=b[i-1];
^~~~
main.cpp:9:33: note: candidates are: int prev [1000050]
int a[NMAX],b[NMAX],dp[10*NMAX],prev[10*NMAX],last[10*NMAX];
^~~~
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/sstream:38,
from /usr/include/c++/6/complex:45,
from /usr/include/c++/6/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/6/bits/stdc++.h:52,
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:35:17: error: reference to 'prev' is ambiguous
if(last[prev[a[i]]])
^~~~
main.cpp:9:33: note: candidates are: int prev [1000050]
int a[NMAX],b[NMAX],dp[10*NMAX],prev[10*NMAX],last[10*NMAX];
^~~~
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/sstream:38,
from /usr/include/c++/6/complex:45,
from /usr/include/c++/6/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/6/bits/stdc++.h:52,
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:37:25: error: reference to 'prev' is ambiguous
dp[a[i]]=dp[prev[a[i]]]+i-last[prev[a[i]]];
^~~~
main.cpp:9:33: note: candidates are: int prev [1000050]
int a[NMAX],b[NMAX],dp[10*NMAX],prev[10*NMAX],last[10*NMAX];
^~~~
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/sstream:38,
from /usr/include/c++/6/complex:45,
from /usr/include/c++/6/ccomplex:39,
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !
