Cod sursa(job #829802)
Utilizator | Data | 5 decembrie 2012 21:16:01 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,max1,a[1001],l[1001],k,t;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
l[n]=1;
for(k=n-1;k>=1;k--)
{
max1=0;
for(i=k+1;i<=n;i++)
if(a[i]>a[k]&&l[i]>max1)
max1=l[i];
l[k]=1+max1;
}
max1=l[1];
t=1;
for(k=1;k<=n;k++)
if(l[k]>max1)
{
max1=l[k];
t=k;
}
g<<max1<<"\n";
g<<a[t]<<" ";
for(i=t+1;i<=n;i++)
if(a[i]>a[t]&&l[i]==max1-1)
{
g<<a[i]<<" ";
max1--;
}
return 0;
}