Cod sursa(job #1016078)

Utilizator Cosmin1490Balan Radu Cosmin Cosmin1490 Data 25 octombrie 2013 18:14:02
Problema Subsir crescator maximal Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 2.24 kb
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <assert.h>
using namespace std;

const string file = "scmax";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f;
int N;
vector<int> A;
vector<int> C;
vector<int> DP;
vector<int> Prec;

class ArbMax
{
public:
	ArbMax(int size);
	void Update(int pos, int val);
	int Query(int pos);
protected:
private:
	static int zeros(int x)
	{
		return (x ^ (x-1)) & x;
	}

	int _size;
	vector<int> _data;
};

ArbMax::ArbMax(int size)
{
	_size = size;
	_data.resize(size + 1);
}

void ArbMax::Update(int pos, int val)
{
	for(int i = pos; i <= _size; i += zeros(i))
	{
		if(DP[_data[i]] < DP[val])
		{
			_data[i] = val;
		}
	}
}

int ArbMax::Query(int pos)
{
	int r = 0;
	for(int i = pos; i > 0; i -= zeros(i))
	{
		if(DP[r] < DP[_data[i]])
		{
			r = _data[i];
		}
	}
	return r;
}



void printSol(ostream &fout, int Sol, int SolM)
{
	if(Sol == 0)
		return;
	printSol(fout, Sol - 1, Prec[SolM]);
	fout << A[SolM] << " ";
}

int main()
{
	fstream fin(infile.c_str(), ios::in);
	fin >> N;
	A.resize(N + 1);
	C.resize(N + 1);
	DP.resize(N + 1);
	Prec.resize(N + 1);
	for(int i = 1; i <= N; i++)
	{
		fin >> A[i];
	}
	fin.close();

	vector<int> B = A;
	sort(B.begin(), B.end());


	for(int i = 1; i <= N; i++)
	{
		C[i] = lower_bound(B.begin(), B.end(), A[i]) - B.begin();
	}

	ArbMax arb(N);

	int Sol = 0;
	int SolM = 0;
	for(int i = 1; i <= N; i++)
	{
		int c = arb.Query(C[i] - 1);
		DP[i] = DP[c] + 1;
		Prec[i] = c;
		arb.Update(C[i], i);
		if(Sol < DP[i])
		{
			Sol = DP[i];
			SolM = i;
		}
	}


	fstream fout(outfile.c_str(), ios::out);
	fout << Sol << "\n";
	printSol(fout, Sol, SolM);
	fout.close();
}