Cod sursa(job #2500631)
| Utilizator | Data | 28 noiembrie 2019 13:35:58 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
long long int n,pre[100001],v[100001],sol[100001];
int main()
{
cin>>n;
for(long long int i=1;i<=n;i++)
{
cin>>v[i];
sol[i]=1;
}
for(long long int i=1;i<=n;i++)
{long max1=0;
for(long long int j=1;j<i;j++)
{
if(v[i]>v[j])
{
if(max1<sol[j]+1)
{
sol[i]=sol[j]+1;
max1=sol[i];
}
}
}
}
cout<<*max_element(sol+1,sol+n+1);
}
