Pagini recente » Cod sursa (job #1938618) | Cod sursa (job #2054082) | Cod sursa (job #542712)
Cod sursa(job #542712)
#include <vector>
#include <fstream>
#include <iostream>
using namespace std;
vector<int> subsir(int* v, int n)
{
int* sir;
sir = new int[n];
for (int i = 0; i < n; i++)
{
sir[i] = 1;
for (int k = i - 1; k >= 0; k--)
if (v[k] < v[i] && sir[i] < sir[k] + 1)
sir[i] = sir[k] + 1;
}
// Afisare sir
//for (int i = 0; i < n; i++)
// cout << sir[i] << " ";
//cout << endl;
vector<int> ret;
int current = sir[n - 1];
for (int i = n - 1; i >= 0 && current >= 1; i--)
if (sir[i] == current)
{
ret.insert(ret.begin(), v[i]);
current--;
}
delete [] sir;
return ret;
}
int main(int argc, char* argv[])
{
ifstream file("scmax.in", ifstream::in);
int n;
int *v;
file >> n;
v = new int[n];
for (int i = 0; i < n; i++)
file >> v[i];
file.close();
ofstream out("scmax.out", ofstream::out);
vector<int> sir = subsir(v, n);
out << (int) sir.size() << endl;
for (vector<int>::iterator it = sir.begin(); it != sir.end(); it++)
out << *(it) << " ";
out.flush();
out.close();
return 0;
}