Cod sursa(job #591376)
Utilizator | Andrei Dinu informatician28 | Data | 23 mai 2011 21:35:22 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
#include<cstdio>
using namespace std;
ifstream f("scmax.in");
int main()
{int n,max=0,i,j,k,l[100002],v[100002];
freopen("scmax.out","w",stdout);
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
l[n]=1;
for(k=n-1;k>=1;k--)
{max=0;
for(j=k+1;j<=n;j++)
if(v[j]>v[k] && l[j]>max)
max=l[j];
l[k]=1+max;}
max=l[1];
for(k=1;k<=n;k++)
if(l[k]>max) max=l[k];
printf("%d",max);
return 0;
}