Pagini recente » Cod sursa (job #427374) | Cod sursa (job #3124532) | Cod sursa (job #638088) | Cod sursa (job #2774598) | Cod sursa (job #1972153)
#include <cstdio>
using namespace std;
int sol[10005];
int main()
{
freopen("culmi.in" , "r" , stdin);
freopen("culmi.out" , "w" , stdout);
int n , i , last , x , m , j;
scanf("%d" , &n);
m = 0;
for(i = 1 ; i <= n ; i ++)
{
scanf("%d" , &x);
last = -1;
for(j = 1 ; j <= m ; j ++)
if(x >= sol[j])
{
last = j;
break;
}
if(last == -1)
sol[++ m] = x;
else
sol[last] = x;
}
printf("%d\n" , m);
return 0;
}