Pagini recente » Cod sursa (job #1132273) | Cod sursa (job #777419) | Cod sursa (job #1241086) | Borderou de evaluare (job #151543) | Cod sursa (job #902117)
Cod sursa(job #902117)
#include <iostream>
#include <fstream>
using namespace std;
FILE *f=fopen("scmax.in","r"),*g=fopen("scmax.out","w");
const int maxn=100005,inf=2000000005;
int n,i,poz,x[maxn],sub[maxn],lung,bst[maxn];
int b_search(int val)
{
int l=1,r=lung,mid;
while(l<r)
{
mid=(l+r)/2;
if(x[sub[mid]]<val)
l=mid+1;
else
r=mid;
}
if(val>x[sub[l]])
l++;
return l-1;
}
void read()
{
fscanf(f,"%d",&n);
fscanf(f,"%d",&x[1]);
sub[1]=bst[1]=lung=1;
for(i=2;i<=n;i++)
{
fscanf(f,"%d",&x[i]);
poz=b_search(x[i]);
bst[i]=poz+1;
sub[poz+1]=i;
lung=max(lung,poz+1);
}
}
void afis(int i,int lung)
{
if(lung>=1)
{
while(bst[i]!=lung)
i--;
afis(i,lung-1);
fprintf(g,"%d ",x[i]);
}
}
int main()
{
read();
fprintf(g,"%d\n",lung);
afis(n,lung);
fprintf(g,"\n");
return 0;
}