Cod sursa(job #682547)

Utilizator SebiSebiPirtoaca George Sebastian SebiSebi Data 19 februarie 2012 09:24:19
Problema Subsir crescator maximal Scor 55
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include<iostream>
#include<fstream>
using namespace std;
int v[100001],l[100001],p[100001],a[100001],nr;
int cautarebinara(int x)
{
	int p,q,mij;
	p=0;
	q=nr;
	while(p<=q) {
		mij=(p+q)/2;
		if((v[l[mij]]<x)&&(v[l[mij+1]]>=x))
			return mij;
		else if(v[l[mij]]>x)
			q=mij-1;
		else p=mij+1;
	}
	return nr;
}
int main ()
{
	int i,poz,n;
	ifstream f("scmax.in");
	ofstream g("scmax.out");
	f>>n;
	for(i=1;i<=n;i++)
		f>>v[i];
	f.close();
	a[1]=1;
	l[1]=1;
	nr=1;
	for(i=2;i<=n;i++) {
		poz=cautarebinara(v[i]);
		a[i]=poz+1;
		l[poz+1]=i;
		if(nr<(poz+1))
			nr=poz+1;
	}
	g<<nr<<'\n';
	for(i=1;i<=nr;i++)
		g<<v[l[i]]<<" ";
	g.close();
	return 0;
}