Pagini recente » Cod sursa (job #1551582) | Cod sursa (job #756193) | Cod sursa (job #2337297) | Cod sursa (job #1545143) | Cod sursa (job #1009125)
#include <cstdio>
#include <climits>
using namespace std;
int a[100010],t[100010][1];
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][0]=1;
t[i][1]=i;
for(j=1; j<=i-1; j++)
if(a[j]<a[i]&&t[j][0]+1>t[i][0])
{
t[i][0]=t[j][0]+1;
t[i][1]=j;
}
if(max<t[i][0])
max=i;
}
i=0;
printf("%d",t[max][0]);
return 0;
}