Cod sursa(job #1066835)
| Utilizator | Data | 25 decembrie 2013 18:08:26 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,v[100005],i,j,k,c,m;
int best[100005];
int main()
{
fin >> n;
for (i=1; i<=n; i++)
fin >> v[i];
for (i=1; i<=n; i++)
{
best[i]=1;
for (j=i-1; j>=1; j--)
if (v[i]>v[j])
best[i]=max(best[i], 1+best[j]);
m=max(m, best[i]);
}
fout << m;
fin.close();
fout.close();
return 0;
}
