Pagini recente » Monitorul de evaluare | Cod sursa (job #1957722) | Cod sursa (job #1764918) | Cod sursa (job #1686002) | Cod sursa (job #1072295)
#include<iostream>
using namespace std;
#include<stdio.h>
FILE *f,*g;
long n,i,j,maxim,l[100003],maximfinal,memorare[100003],m=1,p,b[100];
long long a[100003];
int main()
{
f=fopen("subsir2.in","r");
g=fopen("subsir2.out","w");
fscanf(f,"%ld",&n);
for(i=1;i<=n;i++)
fscanf(f,"%lld",&a[i]);
l[n]=1;
for(i=n-1;i>=1;i--)
{
maxim=0;
for(j=i+1;j<=n;j++)
if(a[i]<a[j]&&l[j]>maxim)
{maxim=l[j];
p=j;
}
b[p]=1;
l[i]=maxim+1;
}
for(i=n;i>=1;i--)
if(b[i]==0)
{p=i;break;}fprintf(g,"%ld\n",l[p]);
maximfinal=l[p];
for(i=p;i<=n;i++)
{
if(l[i]==maximfinal)
{fprintf(g,"%ld ",i);
maximfinal--;}
}
}