Cod sursa(job #2037608)
| Utilizator | Data | 12 octombrie 2017 16:22:11 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fi("scmax.in");
ofstream fo("scmax.out");
int n;
int maxi,lmax;
int X[100001],L[100001];
int main()
{
fi>>n;
L[1]=1;
for(int i=1; i<=n; i++)
fi>>X[i];
for(int i=2; i<=n; i++)
{
maxi=0;
for(int j=1; j<i; j++)
if(maxi<L[j] && X[i]>X[j])
{
maxi=L[j];
L[i]=maxi;
}
L[i]++;
if(lmax<L[i])
lmax=L[i];
}
fo<<lmax;
fi.close();
fo.close();
return 0;
}
