Pagini recente » Cod sursa (job #2902141) | Cod sursa (job #2719373) | Cod sursa (job #2937096) | Cod sursa (job #119477) | Cod sursa (job #2507097)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int i,j,n,v[100001],v2[100001],mx;
int main()
{f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
v2[i]=1;mx=0;
for(j=i-1;j>=1;j--)
{
if(v[i]>v[j])
{
if(mx<v2[j]+1)
{
v2[i]=v2[j]+1;
mx=v2[i];
}
}
}
}
g<<*max_element(v2+1,v2+n+1);
return 0;
}