Cod sursa(job #863323)
| Utilizator | Data | 23 ianuarie 2013 18:42:40 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
FILE *f=fopen("scmax.in","r");
FILE *g=fopen("scmax.out","w");
int a[100000],v[100000],mx,mx1,i,j,ok,n;
int main()
{
fscanf(f,"%d",&n);
for (i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
a[n]=1;
for (i=n-1;i>=1;i--){
ok=0;
mx1=0;
for (j=i+1;j<=n;j++)
if (v[j]>v[i] && a[j]>mx1)
{
mx1=a[j];
ok=1;
}
a[i]=mx1+1;
}
for (i=1;i<=n;i++)
if (a[i]>mx) mx=a[i];
fprintf(g,"%d",mx);
fclose(g);
return 0;
}
