Cod sursa(job #2950991)
| Utilizator |  Dart Monkey lucametehau |
Data | 5 decembrie 2022 09:11:04 |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.25 kb |
#import<fstream>
std::ifstream f("scmax.in");std::ofstream g("scmax.out");int n,r,i,x,v[1<<17],k[2505],a[1<<17];void p(int i){while(a[i--]-r);if(--r)p(i);g<<v[i]<<" ";}main(){for(f>>x;f>>x;r+=n>r,k[a[++i]=n]=v[i]=x,n=0)while(r-n++&&k[n]<x);g<<r<<" ",p(i);}
