Pagini recente » Borderou de evaluare (job #1702890) | Borderou de evaluare (job #1064922) | Borderou de evaluare (job #1618969) | Borderou de evaluare (job #489017) | Borderou de evaluare (job #1586104)
Borderou de evaluare (job #1586104)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:12:18: warning: array subscript has type ‘char’ [-Wchar-subscripts]
M[++ind][w[0]]=1;
^
user.cpp:13:16: warning: array subscript has type ‘char’ [-Wchar-subscripts]
B[ind][w[0]]=1;
^
user.cpp:19:40: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(p[j]<w[i]) M[ind&1][w[i]]=max(M[ind&1][w[i]],B[(ind-1)&1][p[j]]+1);
^
user.cpp:19:59: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(p[j]<w[i]) M[ind&1][w[i]]=max(M[ind&1][w[i]],B[(ind-1)&1][p[j]]+1);
^
user.cpp:19:78: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(p[j]<w[i]) M[ind&1][w[i]]=max(M[ind&1][w[i]],B[(ind-1)&1][p[j]]+1);
^
user.cpp:20:40: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(p[j]>w[i]) B[ind&1][w[i]]=max(B[ind&1][w[i]],M[(ind-1)&1][p[j]]+1);
^
user.cpp:20:59: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(p[j]>w[i]) B[ind&1][w[i]]=max(B[ind&1][w[i]],M[(ind-1)&1][p[j]]+1);
^
user.cpp:20:78: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(p[j]>w[i]) B[ind&1][w[i]]=max(B[ind&1][w[i]],M[(ind-1)&1][p[j]]+1);
^
user.cpp:23:30: warning: array subscript has type ‘char’ [-Wchar-subscripts]
M[ind&1][p[j]]=M[(ind-1)&1][p[j]];
^
user.cpp:23:49: warning: array subscript has type ‘char’ [-Wchar-subscripts]
M[ind&1][p[j]]=M[(ind-1)&1][p[j]];
^
user.cpp:24:30: warning: array subscript has type ‘char’ [-Wchar-subscripts]
B[ind&1][p[j]]=B[(ind-1)&1][p[j]];
^
user.cpp:24:49: warning: array subscript has type ‘char’ [-Wchar-subscripts]
B[ind&1][p[j]]=B[(ind-1)&1][p[j]];
^
user.cpp:29:34: warning: array subscript has type ‘char’ [-Wchar-subscripts]
sol=max(sol,M[ind&1][p[j]]),sol=max(sol,B[ind&1][p[j]]);
^
user.cpp:29:62: warning: array subscript has type ‘char’ [-Wchar-subscripts]
sol=max(sol,M[ind&1][p[j]]),sol=max(sol,B[ind&1][p[j]]);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 424kb | Incorect | 0 |
2 | 0ms | 420kb | Incorect | 0 |
3 | 0ms | 428kb | Incorect | 0 |
4 | 0ms | 424kb | Incorect | 0 |
5 | 0ms | 428kb | Incorect | 0 |
6 | 4ms | 444kb | Incorect | 0 |
7 | 40ms | 524kb | Incorect | 0 |
8 | 144ms | 768kb | Incorect | 0 |
9 | 208ms | 912kb | Incorect | 0 |
10 | 212ms | 912kb | Incorect | 0 |
Punctaj total | 0 |