Cod sursa(job #2335448)
Utilizator | Tanislav Cosmin Cozzmy13 | Data | 4 februarie 2019 09:44:48 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <bits/stdc++.h>
std::ifstream f("scmax.in");std::ofstream g("scmax.out");int v[2e5],p[2e5],q[2e5], 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];x=v[i];j=1;while(x>q[j]&&j<=Q)j++;q[j]=x;p[i]=j;Q=std::max(Q,j);}g<<Q<<"\n";a(Q,n);}