Cod sursa(job #1184594)
| Utilizator | Data | 13 mai 2014 13:23:28 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include<cstdio>
int v[100001];
int main()
{
FILE *in, *out;
in = fopen("scmax.in", "r");
out = fopen("scmax.out", "w");
int n;
fscanf(in, "%d", &n);
for(int i = 1; i <= n; i++)
fscanf(in, "%d", &v[i]);
int max, i, j;
l[n] = 1;
for(i = n - 1; i >= 1; i--)
{
max = 0;
for(j = i+1; j <= n; j++)
{
if(v[j] > v[i] && l[j] > max)
max = l[j];
}
l[i] = max + 1;
}
fprintf(out, "%d", max);
return 0;
}
