Cod sursa(job #486914)
Utilizator | Moraru Valentina valentina506 | Data | 23 septembrie 2010 09:50:58 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
using namespace std;
long k,n,i,j,l[10000],v[10000],max1,t;
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--)
{
max1=0;
for(i=k+1;i<=n;i++)
if(v[k]<v[i]&&l[i]>max1)
{
max1=l[i];
l[k]=max1+1;
}
max1=0;
for(i=1;i<=n;i++)
if(max1<l[i])
{
max1=l[i];
t=i;
}
}
g<<l[t]<<"\n";
g<<v[t]<<" ";
for(i=t+1;i<=n;i++)
if(v[i]>v[t]&&l[i]==max1-1)
{
g<<v[i]<<" ";
max1--;
}
return 0;
}