Pagini recente » Cod sursa (job #2823500) | Cod sursa (job #2892994) | Cod sursa (job #2544005) | Cod sursa (job #1856792) | Cod sursa (job #2028335)
#include <cstdio>
#include <vector>
using namespace std;
#define N 10001
int n,k=0;
vector <int> A[N];
FILE *f = fopen("scmax.in","r");
FILE *g = fopen("scmax.out","w");
int cb(int x)
{
int r = 0, pas = 1<<20;
while(pas)
{
if(r+pas <= k)
{
if(A[r+pas][A[r+pas].size()-1]>x)
r += pas;
else if(A[r+pas][A[r+pas].size()-1]==x)
return -1;
}
pas/=2;
}
return r+1;
}
int main()
{
int i,maxim=0,rasp;
int x;
fscanf(f,"%d",&n);
for(i=1; i<=n; i++)
{
fscanf(f,"%d",&x);
int y=cb(x);
if(y>k)
k++;
if(y!=-1)
{
A[y].push_back(x);
if(A[y].size()>maxim)
{
maxim=A[y].size();
rasp=y;
}
}
}
fprintf(g,"%d\n",maxim);
for(i=0;i<A[rasp].size();i++)
fprintf(g,"%d ",A[rasp][i]);
return 0;
}