Pagini recente » Cod sursa (job #527990) | Cod sursa (job #2312047) | Cod sursa (job #2129007) | Cod sursa (job #986872) | Cod sursa (job #1325069)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,L[100010],a[100010],i,j,prim,succ[100010],lmax;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
L[n]=1;
succ[n]=0;
for(i=n-1;i>=1;i--)
{
for(j=i+1;j<=n;j++)
if(a[j]>a[i])
if(L[j]>=L[i])
{
L[i]=L[j]+1;
succ[i]=j;
}
if(lmax<L[i])
{
lmax=L[i];
prim=i;
}
}
g<<lmax;
return 0;
}