Pagini recente » Cod sursa (job #1542550) | Cod sursa (job #3175843) | Cod sursa (job #1354190) | Cod sursa (job #2303131) | Cod sursa (job #1808356)
#include <fstream>
using namespace std;
int n,i,j,k,p,st,dr,ok,a[100001],b[100001],c[100001];
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
b[n]=1;
c[1]=a[n];
b[0]=1;
p=n;
for(i=n-1; i>=1; i--)
{
if(a[i]>c[1])
{
c[1]=a[i];
b[i]=1;
}
else
if(a[i]<c[b[0]])
{
c[b[0]+1]=a[i];
b[i]=b[0]+1;
b[0]++;
p=i;
}
else
{
st=1;
dr=b[0];
ok=1;
while(st<=dr&&ok)
{
k=(st+dr)/2;
if(c[k]>a[i]&&c[k+1]<=a[i])
{
b[i]=k+1;
c[k+1]=a[i];
ok=0;
}
else
if(a[i]>c[k])
dr=k-1;
else
st=k+1;
}
}
}
g<<b[0]<<'\n';
while(b[0])
{
g<<a[p]<<" ";
ok=1;
for(j=p+1; j<=n&&ok; j++)
if(b[j]==b[0]-1)
{
p=j;
ok=0;
}
b[0]--;
}
g<<'\n';
f.close(); g.close();
return 0;
}