Cod sursa(job #1965679)
Utilizator | maidan alin alin_maidan | Data | 14 aprilie 2017 15:56:37 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
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()
{unsigned long long n,v[10002],lung[10002],i,lmax=1,j;
fin>>n;
for(i=1; i<=n; i++)
{
fin>>v[i];
}
lung[1]=1;
lung[0]=0;
for(i=2; i<=n; i++)
{
j=i-1;
while(v[j]>=v[i]&&j)
{
j--;
}
lung[i]=lung[j]+1;
if(lung[i]>lmax)
{
lmax=lung[i];
}
}
cout<<lmax;
return 0;
}