NOIP2016 T5 蚯蚓

解题报告

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;

int getint()
{
int i=0,f=1;char c;
for(c=getchar();(c>'9'||c<'0')&&c!='-';c=getchar());
if(c=='-')f=-1,c=getchar();
for(;c>='0'&&c<='9';c=getchar())i=(i<<1)+(i<<3)+c-'0';
return i*f;
}

const int N=8e6+5,INF=0x3f3f3f3f;
int n,m,q,u,v,t,h1,h2,h3,t1,t2,t3,delta;
int q1
,q2
,q3
;
double p;

bool cmp(const int &a,const int &b)
{
return a>b;
}

int getmax()
{
int a=-INF,b=-INF,c=-INF,x;
if(h1<t1)a=q1[h1+1]+delta;
if(h2<t2)b=q2[h2+1]+delta;
if(h3<t3)c=q3[h3+1]+delta;
x=max(a,max(b,c));
if(x==a)h1++;
else if(x==b)h2++;
else h3++;
return x;
}

int main()
{
//freopen("lx.in","r",stdin);
n=getint(),m=getint(),q=getint(),u=getint(),v=getint(),t=getint();
p=u*1.0/v;
for(int i=1;i<=n;i++)q1[++t1]=getint();

sort(q1+1,q1+t1+1,cmp);

for(int i=1;i<=m;i++)
{
int x=getmax();
int tmp=(long long)x*u/v;
delta+=q;
q2[++t2]=tmp-delta;
q3[++t3]=x-tmp-delta;
if(i%t==0)cout<<x<<" ";
}
cout<<'\n';

for(int i=1;i<=n+m;i++)
{
int x=getmax();
if(i%t==0)cout<<x<<" ";
}
return 0;
}