#396
SCLM
Se dă un șir cu n
elemente, numere naturale. Determinați un cel mai lung subșir crescător al șirului.
Problema | SCLM | Operații I/O |
sclm.in /sclm.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #37262235 | Utilizator | |
Fișier | sclm.cpp | Dimensiune | 604 B |
Data încărcării | 29 Iulie 2022, 10:28 | Scor / rezultat | Eroare de compilare |
sclm.cpp: In function 'int main()': sclm.cpp:10:15: error: reference to 'next' is ambiguous a[n] = 1, next[n] = -1; ^ sclm.cpp:5:26: note: candidates are: int next [1001] int n, v[1001], a[1001], next[1001], p=1; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0, from /usr/include/c++/4.8/bits/char_traits.h:39, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from sclm.cpp:1: /usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:184:5: note: template<class _ForwardIterator> _ForwardIterator std::next(_ForwardIterator, typename std::iterator_traits<_Iter>::difference_type) next(_ForwardIterator __x, typename ^ sclm.cpp:12:19: error: reference to 'next' is ambiguous a[i] = 1, next[i] = -1; ^ sclm.cpp:5:26: note: candidates are: int next [1001] int n, v[1001], a[1001], next[1001], p=1; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0, from /usr/include/c++/4.8/bits/char_traits.h:39, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from sclm.cpp:1: /usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:184:5: note: template<class _ForwardIterator> _ForwardIterator std::next(_ForwardIterator, typename std::iterator_traits<_Iter>::difference_type) next(_ForwardIterator __x, typename ^ sclm.cpp:15:32: error: reference to 'next' is ambiguous a[i] = a[j]+1, next[i] = j; ^ sclm.cpp:5:26: note: candidates are: int next [1001] int n, v[1001], a[1001], next[1001], p=1; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0, from /usr/include/c++/4.8/bits/char_traits.h:39, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from sclm.cpp:1: /usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:184:5: note: template<class _ForwardIterator> _ForwardIterator std::next(_ForwardIterator, typename std::iterator_traits<_Iter>::difference_type) next(_ForwardIterator __x, typename ^ sclm.cpp:23:13: error: reference to 'next' is ambiguous p = next[p]; ^ sclm.cpp:5:26: note: candidates are: int next [1001] int n, v[1001], a[1001], next[1001], p=1; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0, from /usr/include/c++/4.8/bits/char_traits.h:39, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from sclm.cpp:1: /usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:184:5: note: template<class _ForwardIterator> _ForwardIterator std::next(_ForwardIterator, typename std::iterator_traits<_Iter>::difference_type) next(_ForwardIterator __x, typename ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema SCLM face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.