Cod sursa(job #688497)
Utilizator | Alex Suciu alexsuciu | Data | 23 februarie 2012 16:49:42 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
long N,i,k,m,t,l[100001],v[100001];
int main()
{ifstream f("scmax.in");
ofstream g("scmax.out");
f>>N;
for(i=1;i<=N;i++)
f>>v[i];
l[N]=1;
for(k=N-1;k>=1;k--)
{m=0;
for(i=k+1;i<=N;i++)
if(v[i]>v[k] && l[i]>m)
m=l[i];
l[k]=1+m;}
m=l[1];
t=1;
for(i=1;i<=N;i++)
if(l[i]>m)
{m=l[i];
t=i;}
g<<m<<endl;
g<<v[t]<<" ";
for(i=t+1;i<=N;i++)
if(v[i]>v[t] && l[i]==m-1)
{g<<v[i]<<" ";
m--;}
f.close();
g.close();
return 0;}