Pagini recente » Cod sursa (job #2161091) | Cod sursa (job #2711147) | Cod sursa (job #555416) | Cod sursa (job #599733) | Cod sursa (job #1487071)
#include <stdio.h>
#define NMAX 100000
int a[NMAX], b[NMAX], poz[NMAX];
int n, m;
using namespace std;
void citire(FILE *f)
{
int i;
fscanf(f, "%d", &n);
for (i = 1; i <= n; i++)
fscanf(f, "%d", &a[i]);
}
int cautare(int p, int u, int x)
{
int m;
while(p <= u)
{
m = p + (u - p)/2;
if(x < a[b[m]])
p = m + 1;
else
u = m - 1;
}
return p;
}
void rezolvare()
{
int i, k;
a[0] = 123454553;
for(i = n; i >= 1; i--)
{
poz[i] = 0;
k = cautare(1, m, a[i]);
if(k > m)
{
poz[i] = b[k - 1];
m = k;
b[k] = i;
}
else
{
poz[i] = b[k - 1];
if(a[b[k]] < a[i])
b[k] = i;
}
}
}
void afisare(FILE *g)
{
int i;
fprintf(g, "%d\n", m);
for(i =b[m]; i > 0; i = poz[i])
fprintf(g, "%d ", a[i]);
}
int main()
{
FILE *f, *g;
f = fopen("scmax.in", "r");
g = fopen("scmax.out", "w");
citire(f);
rezolvare();
afisare(g);
fclose(f);
fclose(g);
return 0;
}