#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 | #28038532 | Utilizator | |
Fișier | sclm.cpp | Dimensiune | 952 B |
Data încărcării | 19 Februarie 2021, 15:45 | Scor / rezultat | Eroare de compilare |
sclm.cpp: In function 'int main()': sclm.cpp:18:9: error: reference to 'prev' is ambiguous prev[i]=i; ^ sclm.cpp:6:22: note: candidates are: int prev [1003] int v[1003],dp[1003],prev[1003]; ^ 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:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type) prev(_BidirectionalIterator __x, typename ^ sclm.cpp:27:21: error: reference to 'prev' is ambiguous prev[i]=j; ^ sclm.cpp:6:22: note: candidates are: int prev [1003] int v[1003],dp[1003],prev[1003]; ^ 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:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type) prev(_BidirectionalIterator __x, typename ^ sclm.cpp:35:13: error: reference to 'prev' is ambiguous prev[n+1]=i; ^ sclm.cpp:6:22: note: candidates are: int prev [1003] int v[1003],dp[1003],prev[1003]; ^ 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:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type) prev(_BidirectionalIterator __x, typename ^ sclm.cpp:40:15: error: reference to 'prev' is ambiguous while(pz!=prev[pz]) ^ sclm.cpp:6:22: note: candidates are: int prev [1003] int v[1003],dp[1003],prev[1003]; ^ 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:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type) prev(_BidirectionalIterator __x, typename ^ sclm.cpp:41:26: error: reference to 'prev' is ambiguous idk.push_back(pz=prev[pz]); ^ sclm.cpp:6:22: note: candidates are: int prev [1003] int v[1003],dp[1003],prev[1003]; ^ 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:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type) prev(_BidirectionalIterator __x, typename ^ sclm.cpp:10:15: warning: unused variable 'k' [-Wunused-variable] long long k,n,i,j,rz=0; ^ sclm.cpp:10:23: warning: unused variable 'rz' [-Wunused-variable] long long k,n,i,j,rz=0; ^
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ă.