Borderou de evaluare (job #1624676)

Utilizator DysKodeTurturica Razvan DysKode Data 2 martie 2016 12:54:52
Problema Palalila2 Status done
Runda preoji_4 Compilator cpp | Vezi sursa
Scor 50

Raport evaluator

Compilare: user.cpp: In function ‘int main()’: user.cpp:29:38: warning: array subscript has type ‘char’ [-Wchar-subscripts] for( j = 0 ; j < cor[ s[ i ] ] ; j++ ) ^ user.cpp:30:35: warning: array subscript has type ‘char’ [-Wchar-subscripts] C[ i%2 ][ cor[ s[ i ] ] ] = max( max( C[ (i+1)%2 ][ cor[ s[ i ] ] ] , C[ i%2 ][ cor[ s[ i ] ] ] ) , D[ (i+1)%2 ][ j ] + 1 ); ^ user.cpp:30:77: warning: array subscript has type ‘char’ [-Wchar-subscripts] C[ i%2 ][ cor[ s[ i ] ] ] = max( max( C[ (i+1)%2 ][ cor[ s[ i ] ] ] , C[ i%2 ][ cor[ s[ i ] ] ] ) , D[ (i+1)%2 ][ j ] + 1 ); ^ user.cpp:30:105: warning: array subscript has type ‘char’ [-Wchar-subscripts] C[ i%2 ][ cor[ s[ i ] ] ] = max( max( C[ (i+1)%2 ][ cor[ s[ i ] ] ] , C[ i%2 ][ cor[ s[ i ] ] ] ) , D[ (i+1)%2 ][ j ] + 1 ); ^ user.cpp:31:30: warning: array subscript has type ‘char’ [-Wchar-subscripts] for( j = cor[ s[ i ] ] + 1 ; j < 52 ; j++ ) ^ user.cpp:32:35: warning: array subscript has type ‘char’ [-Wchar-subscripts] D[ i%2 ][ cor[ s[ i ] ] ] = max( max( D[ (i+1)%2 ][ cor[ s[ i ] ] ] , D[ i%2 ][ cor[ s[ i ] ] ] ) , C[ (i+1)%2 ][ j ] + 1 ); ^ user.cpp:32:77: warning: array subscript has type ‘char’ [-Wchar-subscripts] D[ i%2 ][ cor[ s[ i ] ] ] = max( max( D[ (i+1)%2 ][ cor[ s[ i ] ] ] , D[ i%2 ][ cor[ s[ i ] ] ] ) , C[ (i+1)%2 ][ j ] + 1 ); ^ user.cpp:32:105: warning: array subscript has type ‘char’ [-Wchar-subscripts] D[ i%2 ][ cor[ s[ i ] ] ] = max( max( D[ (i+1)%2 ][ cor[ s[ i ] ] ] , D[ i%2 ][ cor[ s[ i ] ] ] ) , C[ (i+1)%2 ][ j ] + 1 ); ^ user.cpp:34:48: warning: array subscript has type ‘char’ [-Wchar-subscripts] ans = max( ans , D[ i%2 ][ cor[ s[ i ] ] ] ); ^ user.cpp:35:48: warning: array subscript has type ‘char’ [-Wchar-subscripts] ans = max( ans , C[ i%2 ][ cor[ s[ i ] ] ] ); ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms412kbOK10
20ms416kbIncorect0
30ms420kbOK10
40ms412kbIncorect0
50ms428kbOK10
68ms436kbOK10
752ms516kbIncorect0
8196ms760kbIncorect0
9284ms904kbOK10
10280ms900kbIncorect0
Punctaj total50

Ceva nu functioneaza?