Pagini recente » Cod sursa (job #1545276) | Cod sursa (job #561999) | Cod sursa (job #9091) | Cod sursa (job #400685) | Cod sursa (job #413343)
Cod sursa(job #413343)
#include <stdio.h>
int n, v[100003], best[100003], p[100003], maxim, k, L[100003], nr;
FILE*g=fopen("scmax.out","w");
void afis(int i)
{
if (p[i] > 0) afis(p[i]);
fprintf(g,"%d ",v[i]);
}
int caut(int x)
{
int p, u, m;
p = 0; u = nr; m = (p+u)/2;
while (p <= u)
{
if (v[L[m]] < x && v[L[m+1]] >= x) return m;
else if (v[L[m+1]] < x) {p = m + 1; m = (p + u)/2;}
else {u = m - 1; m = (p + u)/2;}
}
return nr;
}
int main()
{
FILE*f=fopen("scmax.in","r");
int i, poz;
nr = 1;
fscanf(f,"%d",&n);
for (i=1;i<=n;i++)
fscanf(f,"%d", &v[i]);
fclose(f);
best[1]=L[1]=1;
L[0]=0;
for (i=2;i<=n;i++)
{
poz=caut(v[i]);
p[i]=L[poz];
best[i]=poz + 1;
L[poz+1]=i;
if(nr<poz+1)nr=poz+1;
}
maxim=0;poz=0;
for (i = 1; i <= n; i++)
if (maxim < best[i])
{
maxim = best[i]; poz = i;
}
fprintf(g,"%d\n",maxim);
afis(poz);
fclose(g);
return 0;
}