Pagini recente » Cod sursa (job #1558878) | Cod sursa (job #195772) | Cod sursa (job #1586480) | Cod sursa (job #2285131) | Cod sursa (job #861525)
Cod sursa(job #861525)
#include <stdio.h>
long n, len, d[100001], m[100001], r[100001];
int main()
{
long i, j, k;
freopen("scmax.in", "r", stdin);
freopen("scmax.out", "w", stdout);
scanf("%ld", &n);
scanf("%ld", &j);
d[1] = j;
m[0] = 1;
len = 1;
for(i = 1; i <= n; i++) {
scanf("%ld", &k);
if(d[len] >= k) {
for(j = len; j != 1 && d[len - 1] >= k; j--);
d[j] = k;
} else {
d[++len] = k;
r[len] = i;
}
}
printf("%ld", len);
return 0;
}