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