Cod sursa(job #608259)
Utilizator | Andrei Geogescu mening12001 | Data | 15 august 2011 22:44:29 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream.h>
#include<iostream.h>
int v[100000];
int main()
{ifstream f("scmax.in");
ofstream h("scmax.out");
int i,n,max=0,j;
f>>n;
long long a[100000];
for(i=1;i<=n;i++)
f>>a[i];
v[n]=1;
for(i=n-1;i>=1;i=i-1)
{for(j=i+1;j<=n;j++)
if(v[i]<v[j]&&a[i]<a[j])
v[i]=1+v[j];
if(v[i]==0)
v[i]=1;
if(max<v[i])
max=v[i];}
h<<max<<"\n";
return 0;}