Pagini recente » Borderou de evaluare (job #489570) | Borderou de evaluare (job #1894125) | Borderou de evaluare (job #2132636) | Borderou de evaluare (job #1710962) | Borderou de evaluare (job #2335474)
Borderou de evaluare (job #2335474)
Raport evaluator
Compilare:
main.cpp: In function 'int a(int, int)':
main.cpp:3:171: warning: no return statement in function returning non-void [-Wreturn-type]
std::ifstream f("scmax.in");std::ofstream g("scmax.out");const int N=2e5;int v[N],p[N],q[N],i,j,n,Q,x;int a(int I,int Z){while(p[Z]!=I)Z--;if(I>1)a(I-1,Z-1);g<<v[Z]<<" ";}int main(){f>>n;for(i=1;i<=n;i++){f>>v[i];++v[i];j=1;while(x>q[j]&j<=Q)j++;q[j]=x;p[i]=j;Q=Q>j?Q:j;}g<<Q<<"\n";a(Q,n);}
^
main.cpp: In function 'int main()':
main.cpp:3:232: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
std::ifstream f("scmax.in");std::ofstream g("scmax.out");const int N=2e5;int v[N],p[N],q[N],i,j,n,Q,x;int a(int I,int Z){while(p[Z]!=I)Z--;if(I>1)a(I-1,Z-1);g<<v[Z]<<" ";}int main(){f>>n;for(i=1;i<=n;i++){f>>v[i];++v[i];j=1;while(x>q[j]&j<=Q)j++;q[j]=x;p[i]=j;Q=Q>j?Q:j;}g<<Q<<"\n";a(Q,n);}
~^~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 3ms | 131kb | Lungime incorecta! | 0 | 0 |
2 | 3ms | 131kb | Lungime incorecta! | 0 | 0 |
3 | 2ms | 131kb | Lungime incorecta! | 0 | 0 |
4 | 3ms | 131kb | Lungime incorecta! | 0 | 0 |
5 | 3ms | 131kb | Lungime incorecta! | 0 | 0 |
6 | 3ms | 131kb | Lungime incorecta! | 0 | 0 |
7 | 3ms | 131kb | Lungime incorecta! | 0 | 0 |
8 | 35ms | 917kb | Lungime incorecta! | 0 | 0 |
9 | 36ms | 917kb | Corect! | 10 |
10 | 34ms | 917kb | Lungime incorecta! | 0 |
Punctaj total | 0 |