Cod sursa(job #1857684)
Utilizator | Cioltan Andrei andy1207 | Data | 26 ianuarie 2017 15:38:15 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<cstdio>
const int Nmax=100000;
int v[Nmax+1];
int vv[Nmax+1];
int main()
{
int n;
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d ",&n);
for(int i=1;i<=n;i++)
{
scanf("%d ",&v[i]);
}
int max1=0;
for(int i=1;i<=n;i++)
{
int max=0;
for(int j=i;j>=1;j--)
{
if(v[i]>v[j] && vv[j]>max)
{
max=vv[j];
}
}
vv[i]=max+1;
if(vv[i]>max1)
max1=vv[i];
}
printf("%d\n",max1);
return 0;
}