Cod sursa(job #689159)
Utilizator | Alex Toma alex26 | Data | 24 februarie 2012 10:32:49 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#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;
fin >> n;
for (int i=1; i<=n; i++)
fin >> a[i];
l[1]=1;
for (int i=1; i<n; i++)
{
for (int j=i+1; j<=n; j++)
{
if(a[i]<=a[j] && l[i]+1>l[j])
l[j]=l[i]+1;
}
}
fout << l[n];
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
*/