Cod sursa(job #1787355)
| Utilizator | Data | 24 octombrie 2016 15:33:44 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include<fstream>
using namespace std;
ifstream f("scmax.in"); ofstream g("scmax.out");
int n,best[100003],a[100003],poz[100003];
int main()
{ f>>n;
int i,j,p,lgm;
for(i=1;i<=n;++i) f>>a[i];
best[n]=1; poz[n]=-1; lgm=1; p=n;
for(i=n-1;i;--i)
{ best[i]=1; poz[i]=-1;
for(j=i+1;j<=n;++j)
if(a[i]<a[j] && best[i]<best[j]+1)
{ best[i]=best[j]+1; poz[i]=j;
if(best[i]>lgm) {lgm=best[i]; p=i;}
}
}
g<<lgm<<'\n';
i=p;
while(i!=-1) {g<<a[i]<<' '; i=poz[i];}
g.close(); return 0;
}