Pagini recente » Cod sursa (job #875559) | Cod sursa (job #1482202) | Cod sursa (job #1045763) | Cod sursa (job #1013442) | Cod sursa (job #2833125)
#include <fstream>
#include <iostream>
std::ifstream f("scmax.in");
std::ofstream o("scmax.out");
int main() {
int n; f >> n;
int A[n + 1];
int D[n + 1];
int P[n + 1];
for(int i = 1; i <= n; i++) {
f >> A[i];
}
int k = 1;
D[1] = A[1];
for(int i = 2 ; i <= n ; i ++)
{
if(A[i] > D[k])
D[++k] = A[i];
else
{
int st = 1 , dr = k , poz = k + 1;
while(st <= dr)
{
int m = (st + dr) / 2;
if(D[m] > A[i])
poz = m , dr = m - 1;
else
st = m + 1;
}
D[poz] = A[i];
}
}
o << k << '\n';
for(int x = 1; x <= k; x++) {
o << D[x] << ' ';
}
}