2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛 D. Hack Portals(区间DP)

We all have much to be proud of.

As a player of the game Ingress, IloveMATH is proud of these portals on the road in front of his campus.

Here is a brief introduction of this mobile game. Ingress, as a sandbox game, connects the actual world around us with the virtual battleground.

Those strategic fortress points, we call portals, correspond to the real buildings, sculptures, statues and other objects that can easily be discoverd.

If you read the virtual map of the Ingress world, a neat row of portals along the road in front of Xtended Domain University (XDU) could catch your eye immediately.

The total length of the road is $L$ metres, and there are $N$ portals on the road.

The distance between the left side of the road and the $i$-th portal is XiX_iX​i​​, where 0≤Xi≤L0\le X_i\le L0≤X​i​​≤L and XiX_iX​i​​ is an integer.

The gate of XDU is situated on $K$, where $K$ is an integr and $0\le K\le L$ as well.

To get more virtual supplies and properties in the game, IloveMATH should hack these portals.

Hacking a portal can get some items randomly such as missiles, shields and turrets.

However, hacking would heat the portal and the player could not hack it again until the portal finished the process of cooling.

Now IloveMATH stands at the left side of the road (located on $0$).

He knows the end time of cooling for each portal.

His mission is to visit and hack each portal at least once and go back to the school gate.

The time consumption of moving from $i$ to $j$ is $|i-j|$ and the hacking is instantaneous (its time consumption is $0$).

Help IloveMATH finish the mission as soon as possible. It's time to move.

Input Format

The input of this problem contains several test cases.

The first line of the input provides the total number of test cases.

Each test case is consists of $N+1$ lines and the first lines provides three integers $N(N\le 1000)$, $L(L\le 1000)$ and $K(0\le K\le L)$.

The following $N$ lines correspond to $N$ portals and the $i$-th line contains the location of the portal, and its end time of cooling.

All input numbers should be small than $32768$.

Output Format

For each test case output the case number first. Then output the best time for completing the mission.

样例输入

1

4 10 3
8 9
4 21
3 16
8 12

样例输出

Case #1: 22

题目来源

2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛

题意: 数轴上有n个点,每个点都在一个特定的时间后出现,你现在的位置在0,问把所有点都访问一次最后走到k的最少时间.

分析:手动画几个例子,可以发现最优解的每个状态中未被hack的po一定是一段连续的区间,于是可以直接上二维区间dp,f[i][j][k]表示[i,j]这段区间之外的都hack后停留在k（左/右）端的最少时间,然后就可以O（1）转移了,总复杂度O(n^2).