Pagini recente » Cod sursa (job #2184737) | Cod sursa (job #2517852) | Cod sursa (job #242919) | Cod sursa (job #2937005) | Cod sursa (job #1111998)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
long v[100010];
int n,l[100010],m,x;
int main()
{
f>>n;
for(int i=1;i<=n;++i) f>>v[i];
for(int i=1;i<=n;++i)
{
if(l[i]==0) l[i]++;
for(int j=i+1;j<=n;++j)
{
if(v[i]<v[j]&&l[j]<l[i]+1)
{
l[j]=l[i]+1;
}
}
}
m=-1;
for(int k=1;k<=n;k++) m=max(m,l[k]);
g<<m<<'\n';
}