Pagini recente » Cod sursa (job #2117112) | Cod sursa (job #2333851) | Cod sursa (job #2468947) | Cod sursa (job #1050699) | Cod sursa (job #2588631)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int nmax=100005;
int n,best[nmax];
long long a[nmax];
void read_data()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
}
void solve()
{
for(int i=1;i<=n;i++)
best[i]=1;
for(int j=1;j<=n;j++)
for(int i=1;i<j;i++)
if(a[j]>a[i])
best[j]=max(best[j],best[i]+1);
int mx=0;
for(int it=1;it<=n;it++)
mx=max(mx,best[it]);
fout<<mx;
}
int main()
{
read_data();
solve();
return 0;
}