Pagini recente » Cod sursa (job #1904617) | Cod sursa (job #1814165) | Istoria paginii runda/oji-2015-cls11-12124151 | Cod sursa (job #1232107) | Cod sursa (job #1941549)
#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cctype>
#define pb push_back
#define mp make_pair
#define MAXN 100003
#define DIM 8192
using namespace std;
class Reader
{
public:
Reader(const char* filename)
{
if(filename[0]=='.'||filename[0]==0)
{
cout<<"Check INFILE.\n";
return;
}
try
{
f.open(filename);
pos = 0;
if(f.fail())throw 1;
f.read(buffer,DIM);
}
catch(int e)
{
cout<<"No INFILE.\n";
delete this;
}
}
inline Reader& operator >>(int& x)
{
x=0;
sgn=1;
while((buffer[pos]<'0'||buffer[pos]>'9')&&buffer[pos]!='-')
if(++pos==DIM)
f.read(buffer,DIM),pos=0;
if(buffer[pos]=='-')sgn=-1,pos++;
while(buffer[pos]>='0'&&buffer[pos]<='9')
{
x=x*10+buffer[pos]-'0';
if(++pos==DIM)f.read(buffer,DIM),pos=0;
}
x*=sgn;
return (*this);
}
inline Reader& operator >>(char* c)
{
aux = 0;
while(isspace(buffer[pos]))
if(++pos==DIM)
f.read(buffer,DIM),pos=0;
while(!isspace(buffer[pos]))
{
c[aux++]=buffer[pos];
if(++pos==DIM)f.read(buffer,DIM),pos=0;
}
return (*this);
}
~Reader()
{
f.close();
}
private:
ifstream f;
int pos,aux,sgn;
char buffer[DIM];
};
class Writer
{
public:
Writer(const char* filename)
{
if(filename[0]=='.'||filename[0]==0)
cout<<"Check OUTFILE. Nothing created.\n";
else
{
g.open(filename);
pos = 0;
}
}
inline Writer& operator <<(int xx)
{
aux = 0;
x = xx;
if(xx<0)x=-x;
if(x==0)
nr[aux++]='0';
while(x)
{
nr[aux++]=x%10+'0';
x/=10;
}
if(xx<0)nr[aux++]='-';
while(aux>0)
{
buffer[pos++]=nr[--aux];
if(pos==DIM)g.write(buffer,DIM),pos=0;
}
return (*this);
}
inline Writer& operator <<(const char* c)
{
aux = 0;
while(c[aux])
{
buffer[pos++]=c[aux++];
if(pos==DIM)g.write(buffer,DIM),pos=0;
}
return (*this);
}
inline void flush()
{
g.write(buffer,pos);
pos=0;
}
~Writer()
{
g.write(buffer,pos);
g.close();
}
private:
ofstream g;
int pos,aux,x;
char buffer[DIM],nr[21];
};
Reader f("scmax.in");
Writer g("scmax.out");
int n,i,j,pos,k,nr,maxim,v[MAXN],L[MAXN],p[MAXN],best[MAXN];
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;
}
void afis(int i)
{
if(p[i])afis(p[i]);
g<<v[i]<<" ";
}
int main()
{
ios_base::sync_with_stdio(false);
f>>n;
nr=1;
for(i=1;i<=n;i++)
f>>v[i];
best[i]=L[i]=1;
for(i=2;i<=n;i++)
{
pos=caut(v[i]);
p[i]=L[pos];
best[i]=pos;
L[pos+1]=i;
if(nr<pos+1)nr=pos+1;
}
pos=0;
for(i=1;i<=n;i++)
if(maxim<best[i])
{
maxim=best[i];
pos=i;
}
g<<maxim<<"\n";
afis(pos);
return 0;
}