Cod sursa(job #716920)

Utilizator raulstoinStoin Raul raulstoin Data 19 martie 2012 13:36:28
Problema Subsir crescator maximal Scor 45
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include<fstream>
using namespace std;
int a[100000],b[100000],c[100000][2],n,d[100000],l;
void maxim()
{
	freopen("scmax.out","w",stdout);
	int i,m=0,p;
	for(i=0;i<n;i++)
		if(b[i]>m)
		{
			p=i;
			m=b[i];
		}
	printf("%d\n",m);
	d[l++]=a[c[p][1]];
	for(i=c[p][1]-1;i>=c[p][0];i--)
		if(a[i]<d[l-1] && a[i]>=a[c[p][0]])
			d[l++]=a[i];
	for(i=l-1;i>=0;i--)
		printf("%d ",d[i]);
	printf("\n");
}
int main()
{
	int i,j,m;
	freopen("scmax.in","r",stdin);
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
		b[i]=1;
		c[i][0]=c[i][1]=i;
		m=0;
		for(j=i-1;j>=0;j--)
			if(a[j]<a[i])
				if(m<b[j])
				{
					m=b[j];
					b[i]=b[j]+1;
					c[i][0]=c[j][0];
				}
	}
	maxim();
	return 0;
}