Cod sursa(job #2950905)
| Utilizator |  Dart Monkey lucametehau |
Data | 4 decembrie 2022 20:18:18 |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
std::ifstream f("scmax.in");std::ofstream g("scmax.out");int n,r,i,s,m,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(){for(f>>n,i=1;i<=n;i++){f>>v[i],k[i]=2e9;while(k[s]<v[i])r+=++s>r;s=k[s-1]<v[i]?k[a[i]=s]=v[i],0:0;}g<<r<<" ",p(i);}