Cod sursa(job #2507095)
Utilizator | Data | 9 decembrie 2019 17:03:42 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int i,j,n,v[100001],v2[100001];
int main()
{f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
v2[i]=1;
for(j=i-1;j>=1;j--)
{
if(v[i]>v[j])
{
v2[i]=v2[j]+1;
break;
}
}
}
g<<*max_element(v2+1,v2+n+1);
return 0;
}