Pagini recente » Cod sursa (job #1989486) | Cod sursa (job #2330660) | Cod sursa (job #2560013) | Cod sursa (job #917677) | Cod sursa (job #3324217)
/******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
int n;
f>>n;
vector<int> v(n), best(n), sir(n);
for(int i=0; i<n; i++)
{
f>>v[i];
}
/* for(int i=0; i<n-1; i++)
{
for(int j=i+1; j<n; j++)
{
if(v[i]<v[j])
{
best[j] = max(best[j], best[i] + 1);
}
}
}*/
sir[0] = v[0];
best[0] = 0;
int dr = 0;
for(int i=1; i<n; i++)
{
int st = 0, dr2 = dr, m;
bool ok = 0;
if(v[i] > sir[dr])
{
dr++;
sir[dr] = v[i];
best[i] = dr;
}
else
{
while(st <= dr2)
{
m = (st + dr2)/2;
if(sir[m] >= v[i])
{
dr2 = m - 1;
}
else
{
st = m + 1;
}
}
// st = poziția unde trebuie pus v[i]
if(st > dr)
{
dr++;
sir[dr] = v[i];
best[i] = dr;
}
else
{
sir[st] = v[i];
best[i] = st;
}
}
}
int aux=0;
for(int i=0; i<n; i++)
{
if(aux<best[i])
{
aux=best[i];
}
}
g<<aux+1<<endl;
vector<int> v2;
for(int i=n-1; i>=0; i--)
{
if(best[i]==aux)
{
v2.push_back(v[i]);
aux--;
}
}
for(int i=v2.size()-1; i>=0; i--)
{
g<<v2[i]<<" ";
}
return 0;
}