Cod sursa(job #1009141)
| Utilizator | Data | 12 octombrie 2013 15:36:45 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <cstdio>
#include <climits>
using namespace std;
int a[100010],t[100010];
int main()
{
int n,k,i,j,max=INT_MIN;
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(i=1; i<=n; i++)
{
scanf("%d",&a[i]);
t[i]=1;
for(j=1; j<=i-1; j++)
if(a[j]<a[i]&&t[j]+1>t[i])
{
t[i]=t[j]+1;
}
if(t[max]<t[i])
max=i;
}
printf("%d",t[max]);
return 0;
}
