Cod sursa(job #1481033)

Utilizator al.mocanuAlexandru Mocanu al.mocanu Data 3 septembrie 2015 17:50:54
Problema Subsir crescator maximal Scor 60
Compilator c Status done
Runda Arhiva educationala Marime 0.97 kb
#include <stdio.h>
#define MAX 100005

int n, v[MAX], q[MAX], p[MAX], i, l;

int bs(int l, int x);
void print(int x, int y);

int main(){
	freopen("scmax.in", "r", stdin);
	freopen("scmax.out", "w", stdout);
	scanf("%d", &n);
	for(i = 0; i < n; i++){
		scanf("%d", &v[i]);
		p[i] = bs(l, v[i]);
		q[p[i]] = v[i];
		if(l < p[i])
			l = p[i];
	}

	printf("%d\n", l);
	print(1, 1);
	return 0;
}

int bs(int l, int x){
	int s = 1, d = l, m;
	if(l == 0)
		return 1;
	while(s < d){
		m = (s + d) / 2;
		if(q[m] == x)
			return m;
		if(q[m] > x){
			if(m == 1)
				return m;
			if(q[m - 1] < x)
				return m;
			else
				d = m - 1;
		}
		else
			s = m + 1;
	}

	if(s == d){
		if(q[s] == x)
			return s;
		if(q[s] > x){
			if(s == 1)
				return s;
			if(q[s - 1] < x)
				return s;
			else
				return l + 1;
		}
		else
			return l + 1;
	}
}

void print(int x, int y){
	if(x == n + 1 || y == l + 1)
		return;
	if(p[x] == y){
		printf("%d ", v[x]);
		print(x + 1, y + 1);
	}
	else
		print(x + 1, y);
}