Cod sursa(job #531180)
Utilizator | Data | 9 februarie 2011 07:45:14 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int v[100001],l[100001],n,i,k,maxim,t;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
l[n]=1;
for(k=n-1;k>=1;k--)
{
maxim=0;
for(i=k+1;i<=n;i++)
if(v[i]>=v[k] && l[i]>maxim)
maxim=l[i];
l[k]=1+maxim;
}
maxim=l[1];
t=1;
for(k=1;k<=n;k++)
if(l[k]>maxim)
{
maxim=l[k];
t=k;
}
g<<maxim;
g<<"\n";
for(i=t+1;i<=n;i++)
if(v[i]>v[t] && l[i]==maxim-1)
{
g<<v[i]<<" ";
maxim--;
}
return 0;
}