Submission #1444765

---

Source Code Expand

// This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template<typename T> void get_int(T &x)
{
	char t=getchar();
	bool neg=false;
	x=0;
	for(; (t>'9'||t<'0')&&t!='-'; t=getchar());
	if(t=='-')neg=true,t=getchar();
	for(; t<='9'&&t>='0'; t=getchar())x=x*10+t-'0';
	if(neg)x=-x;
}
template<typename T> void print_int(T x)
{
	if(x<0)putchar('-'),x=-x;
	short a[20]= {},sz=0;
	while(x>0)a[sz++]=x%10,x/=10;
	if(sz==0)putchar('0');
	for(int i=sz-1; i>=0; i--)putchar('0'+a[i]);
}
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define get1(a) get_int(a)
#define get2(a,b) get1(a),get1(b)
#define get3(a,b,c) get1(a),get2(b,c)
#define printendl(a) print_int(a),puts("")
typedef long long LL;
typedef unsigned long long uLL;
typedef pair<int,int> pii;
const int inf=0x3f3f3f3f;
const LL Linf=1ll<<61;
const double pi=acos(-1.0);

int n,t,e,x[100111],fr,rr=1,q[100111];
LL dp[100111],premn[100111];

int main()
{
	get3(n,e,t);
	for(int i=1;i<=n;i++)get1(x[i]);
	int cur=0;
	premn[0]=-2*x[1];
	for(int i=1;i<=n;i++)
	{
		while((x[i]-x[cur+1])*2>t)
		{
			if(fr!=rr&&q[fr]==cur)fr++;
			cur++;
		}
		if(cur)dp[i]=premn[cur-1]+2*x[i];else dp[i]=Linf;
		if(fr!=rr)dp[i]=min(dp[i],dp[q[fr]]+t);
		while(fr!=rr&&dp[q[rr-1]]>dp[i])rr--;
		q[rr++]=i;
		premn[i]=min(premn[i-1],dp[i]-2*x[i+1]);
	}
	printendl(dp[n]+e);
	return 0;
}

Submission Info

Judge Result