Cod sursa(job #859109)
Utilizator | Rares Adrian rares_adrian | Data | 19 ianuarie 2013 18:09:29 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int sir[10],lg[10],n;
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&sir[i]);
lg[i]=1;
}
for(int i=n;i>=1;i--)
{
for(int j=i+1;j<=n;j++)
if(lg[i]<lg[j]+1 && sir[i]<sir[j])
lg[i]=lg[j]+1;
}
int max=0;
for(int i=1;i<=n;i++)
if(max<lg[i])
max=lg[i];
printf("%d",max);
return 0;
}