Pagini recente » Cod sursa (job #233181) | Cod sursa (job #2628766) | Cod sursa (job #2258076) | Cod sursa (job #36155) | Cod sursa (job #2910146)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("scmax.in");
ofstream o("scmax.out");
int n, v[100001];
f>>n;
for(int i=1;i<=n;i++)
{
f>>v[i];
}
int b[n+1];
for(int i=1;i<n;i++)
{
b[i]=1;
for(int j=1;j<i;j++)
if(v[i]>v[j] && b[i]<b[j]+1)
b[i]=b[i]+1;
}
int max=0;
for(int i=1;i<=n;i++)
if(b[i]>max)
max=b[i];
//cout<<max+1;
o<<max+1;
return 0;
}