Pagini recente » Cod sursa (job #2619529) | Cod sursa (job #1713296) | Cod sursa (job #2940015) | Cod sursa (job #874243) | Cod sursa (job #689231)
Cod sursa(job #689231)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main()
{
int n, a[10002], l[10002]={0}, val, max = 1;
fin >> n;
for (int i=1; i<=n; i++)
fin >> a[i];
l[n]=1;
for (int i=n-1; i>=1; i--)
{
l[i]=1;
for (int j=i+1; j<=n; j++)
if(a[i]<a[j] && l[i]<l[j]+1)
l[i] = l[j]+1;
if(l[i]>max)
max = l[i];
}
fout << max;
return 0;
}
/*
12
2 5 5 6 2 8 4 0 1 3 5 8
10
6 2 5 6 5 5 4 3 5 8
*/