Cod sursa(job #1916941)
| Utilizator | Data | 9 martie 2017 10:43:06 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,i,j,maxi,ct;
long long x, v[100001],lung[100001],xp;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
lung[n]=1;
for(i=n-1;i>=1;i--)
{
for(j=i+1;j<=n;j++)
if(v[i]<v[j])
if(lung[j]+1>lung[i])
lung[i]=lung[j]+1;
}
for(i=1;i<=n;i++)
if(lung[i]>maxi) maxi=lung[i];
fout<<maxi;
return 0;
}
