Pagini recente » Cod sursa (job #2362408) | Cod sursa (job #694260) | Cod sursa (job #1836781) | Cod sursa (job #2824507) | Cod sursa (job #579352)
Cod sursa(job #579352)
#include<fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int L[1001];
int main()
{
int n, i, j, smax = -1, a[1001];
fin >> n;
for ( i = 0; i < n; i++ )
fin >> a[i];
for ( i = 0; i < n; i++ )
{
L[i] = 1;
for ( j = 0; j < i; j++ )
if ( L[j] + 1 > L[i] && a[j] < a[i] )
L[i] = L[j] + 1;
}
for ( i = 0; i < n; i++ )
if ( L[i] > smax )
smax = L[i];
fout << smax;
fin.close();
fout.close();
return 0;
}