Cod sursa(job #2477754)
Utilizator | Data | 21 octombrie 2019 08:19:06 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
using namespace std;
ifstream f("scmax.in"); ofstream g("scmax.out");
int n,v[100003],lg[100003],p[100003];
int main()
{ f>>n;
for(int i=1;i<=n;++i) f>>v[i];
lg[n]=1; p[n]=n;
for(int i=n-1;i;--i)
{ p[i]=i;
for(int j=i+1;j<=n;++j)
if(v[i]<v[j] && lg[i]<lg[j]) {lg[i]=lg[j]; p[i]=j;}
lg[i]++;
}
int maxim=lg[1],k=1;
for(int i=2;i<=n;++i)
if(maxim<lg[i]) {maxim=lg[i]; k=i;}
g<<lg[k]<<'\n'<<v[k]<<' ';
do {k=p[k]; g<<v[k]<<' ';} while(lg[k]!=1);
g.close(); return 0;
}