Cod sursa(job #825695)
| Utilizator | Data | 29 noiembrie 2012 13:27:29 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<stdio.h>
int v[100003],l[100003];
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
int n,i,nr=0,j,max=-1;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
////////////////////////////////////////////////
for(i=1;i<=n;i++)
{
for(j=i;j>0;j--)
if(v[i]>v[j-1]&&v[j]>v[j-1])
l[i]++;
}
for(i=1;i<=n;i++)
if(l[i]>max)
max=l[i];
////////////////////////////////////////////////
printf("%d ",max);
printf("\n");
return 0;
}