Cod sursa(job #1112129)
Utilizator | Data | 19 februarie 2014 14:32:12 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,j,L[1005],v[1005],maxL=1,poz[1005],pozmax,sol[1005];
int main()
{
f>>n;
for (i=1;i<=n;i++)
{
f>>v[i]; L[i]=1;
for (j=1;j<i;j++)
{
if (v[j]<v[i] && L[j]+1>L[i]) {L[i]=L[j]+1; poz[i]=j;}
}
if (L[i]>maxL) {maxL=L[i]; pozmax=i;}
}
g<<maxL<<"\n";
n=0;
while (maxL)
{
sol[++n]=v[pozmax];
pozmax=poz[pozmax];
maxL--;
}
for (i=n;i>0;i--) g<<sol[i]<<" ";
return 0;
}