Pagini recente » Cod sursa (job #2349759) | Cod sursa (job #921575) | Cod sursa (job #2712642) | Cod sursa (job #1926013) | Cod sursa (job #1869125)
#include <bits/stdc++.h>
#define nmax 100005
using namespace std;
int n, raspuns;
int v[nmax];
int dinamica[nmax];
void citire()
{
scanf("%d", &n);
for(int i=1;i<=n;i++)
scanf("%d", &v[i]);
}
void rezolvare()
{
dinamica[1]=1;
for(int i=2;i<=n;i++)
{
dinamica[i]=1;
for(int j=1;j<=n;j++)
{
if(v[i]>v[j])
dinamica[i]=max(dinamica[i], dinamica[j]+1);
}
if(dinamica[i]>raspuns)
raspuns=dinamica[i];
}
}
void afisare()
{
printf("%d\n", raspuns);
}
int main()
{
freopen("scmax.in", "r", stdin);
freopen("scmax.out", "w", stdout);
citire();
rezolvare();
afisare();
return 0;
}