Pagini recente » Cod sursa (job #2864572) | Cod sursa (job #2287847) | Cod sursa (job #944466) | Cod sursa (job #3274868) | Cod sursa (job #922483)
Cod sursa(job #922483)
#include <iostream>
#include <stdio.h>
#define MAX_N 100005
using namespace std;
FILE *f=fopen("scmax.in","r");
FILE *g=fopen("scmax.out","w");
int s[MAX_N];
int n,a[MAX_N],i,nr,mx,v[MAX_N],k;
void solve(int mx,int k)
{
int i;
for(i=k;i>=1;i--)
{
if(v[i]==mx)
{
if(mx>1)
{
mx--;
solve(mx,i-1);
}
break;
}
}
if(i==0)i=1;
fprintf(g,"%d ",a[i]);
}
int caut(int val)
{
int p,m,u,mx;
mx=0;
p=1;
u=s[0];
while (p<=u)
{
m=(p+u)/2;
if(s[m]<val)
{
if(m>mx)mx=m;
p=m+1;
} else u=m-1;
}
return mx;
}
int main()
{
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
fscanf(f,"%d",&a[i]);
for(i=1;i<=n;i++)
{
nr=caut(a[i]);
if(nr==s[0])
{
s[0]++;
s[nr+1]=a[i];
}else s[nr+1]=a[i];
v[i]=nr+1;
if (v[i]>mx) {mx=v[i];k=i;}
}
fprintf(g,"%d\n",mx);
solve(mx,k);
return 0;
}