Pagini recente » Cod sursa (job #2423073) | Cod sursa (job #2665841) | Cod sursa (job #1055965) | Cod sursa (job #540898) | Cod sursa (job #2826783)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int d[100001],a[100001],poz[100001];
int main()
{
int i,j,n,mx,p;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
d[n]=1;
poz[n]=-1;
mx=1; p=n;
for(i=n-1;i>=1;--i)
{
d[i]=1;
poz[i]=-1;
for(j=i+1;j<=n;++j)
if(a[i]<a[j] && d[i]<d[j]+1)
{
d[i]=d[j]+1;
poz[i]=j;
if(d[i]>mx) mx=d[i],p=i;
}
}fout<<mx;
return 0;
}