Pagini recente » Istoria paginii runda/oji_11/clasament | Cod sursa (job #447022) | Cod sursa (job #492910) | Cod sursa (job #1651193) | Cod sursa (job #1651195)
#include <iostream>
#include <fstream>
using namespace std;
long binarys( long *a, long *t, long x, long start, long finish){
long mid=(start+finish)/2;
if (a[t[mid-1]]<x && a[t[mid+1]]>x) {if(x<=a[t[mid]]) return mid; else return mid+1;} else if (x>a[t[mid]]) return binarys(a, t, x, mid+1, finish); else return binarys(a, t, x, start, mid-1);
}
int main()
{ long n, a[100005], t[100005], r[100005];
ifstream fin("scmax.in");
ofstream fout("scmax.out");
fin>>n;
int len=0;
for(long i=0; i<n; i++) r[i]=-1;
for(long i=0; i<n; i++) fin>>a[i];
t[0]=0;
for(long i=1; i<n; i++){
if (a[i]>a[t[len]]) {len++; t[len]=i; r[i]=t[len-1];} else
if (a[i]!=a[t[len]]){
if (a[i]<a[t[0]]) t[0]=i; else {
int x=binarys(a, t, a[i], 0, len);
t[x]=i;
r[i]=t[x-1];
}
}
}
fout<<len+1<<endl;
long *sol= new long[len+1];
sol[len]=a[t[len]];
int x=len-1;
int y=len;
len=r[t[len]];
while (len>0){
sol[x]=a[len];
x--;
len=r[len];
}
for(long i=0; i<=y; i++) fout<<sol[i]<<" ";
delete sol;
return 0;
}