Pagini recente » Cod sursa (job #2948207) | Cod sursa (job #1133458) | Monitorul de evaluare | Cod sursa (job #2740069) | Cod sursa (job #1526469)
#include <iostream>
#include <fstream>
#define inf 2000000005
#define nmax 1005
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
long long V[nmax];
int prev[nmax], B[nmax], mx =1, iBest;
int caut_binara(int lo, int hi, long long x)
{
if (V[B[hi-1]]< x) return hi;
if (V[B[lo+1]]> x) return lo+1;
while (hi-lo!=1)
{
int mid = (hi+lo)/2;
if (V[B[mid]] >= x) hi=mid;
else lo=mid;
}
return hi;
} //pozitia pe care trebuie pus V[i]
void recreare(int p)
{
if (p==0) return;
recreare(prev[p]);
g << V[p] << " ";
return;
}
int main()
{
int n;
f >> n;
for(int i=1; i<=n; i++)
{
f >> V[i];
}
B[0]=0; B[1]=1; prev[1]=0;
for(int i=2; i<=n; i++)
{
iBest = caut_binara(0, mx+1, V[i]);
prev[i] = B[iBest-1];
B[iBest]=i;
if (iBest > mx) mx =iBest;
}
g << mx << "\n";
recreare(B[mx]);
return 0;
}