CF #398B The Queue

The Queue

本人渣翻：https://www.zybuluo.com/zhangche0526/note/666142
time limit: per test1 second
memory limit: per test256 megabytes
input: standard input
output: standard output

Finally! Vasya have come of age and that means he can finally get a passport! To do it, he needs to visit the passport office, but it’s not that simple. There’s only one receptionist at the passport office and people can queue up long before it actually opens. Vasya wants to visit the passport office tomorrow.

He knows that the receptionist starts working after ts minutes have passed after midnight and closes after tf minutes have passed after midnight (so that (tf - 1) is the last minute when the receptionist is still working). The receptionist spends exactly t minutes on each person in the queue. If the receptionist would stop working within t minutes, he stops serving visitors (other than the one he already serves).

Vasya also knows that exactly n visitors would come tomorrow. For each visitor Vasya knows the point of time when he would come to the passport office. Each visitor queues up and doesn’t leave until he was served. If the receptionist is free when a visitor comes (in particular, if the previous visitor was just served and the queue is empty), the receptionist begins to serve the newcomer immediately.

“Reception 1”
For each visitor, the point of time when he would come to the passport office is positive. Vasya can come to the office at the time zero (that is, at midnight) if he needs so, but he can come to the office only at integer points of time. If Vasya arrives at the passport office at the same time with several other visitors, he yields to them and stand in the queue after the last of them.

Vasya wants to come at such point of time that he will be served by the receptionist, and he would spend the minimum possible time in the queue. Help him!

Input

The first line contains three integers: the point of time when the receptionist begins to work ts, the point of time when the receptionist stops working tf and the time the receptionist spends on each visitor t. The second line contains one integer n — the amount of visitors (0 ≤ n ≤ 100 000). The third line contains positive integers in non-decreasing order — the points of time when the visitors arrive to the passport office.

All times are set in minutes and do not exceed 1012; it is guaranteed that ts < tf. It is also guaranteed that Vasya can arrive at the passport office at such a point of time that he would be served by the receptionist.

Output

Print single non-negative integer — the point of time when Vasya should arrive at the passport office. If Vasya arrives at the passport office at the same time with several other visitors, he yields to them and queues up the last. If there are many answers, you can print any of them.

Examples
input

10 15 2
2
10 13

output

12

input

8 17 3
4
3 4 5 8

output

2

Note

In the first example the first visitor comes exactly at the point of time when the receptionist begins to work, and he is served for two minutes. At 12 minutes after the midnight the receptionist stops serving the first visitor, and if Vasya arrives at this moment, he will be served immediately, because the next visitor would only come at 13 minutes after midnight.

In the second example, Vasya has to come before anyone else to be served.

---

完全不需要什么算法，然而对细节处理的要求很高，考试时候以为很简单，不过好像题意理解地不清楚（果然英语水平有待提高），有一些细节的特殊情况处理地不好，没过，太可惜了

思路:

best为最短等待时间，ans为去的时刻，ctime储存当前最早能轮到自己的时刻

主要思路就是在每个人去的前一分钟去有可能是最短的，不过需要加一些特判：

• n=0时直接输出开始时间
• 用第一个人到达时间点前一分钟的情况作为best和ans的初始值
• 枚举情况时，如果发现中间某一时刻队列为空，则ans就是这个时间，直接输出
• 最后还要判断，如果最后一个人办理完后还有时间给自己办理，那就在最后一人办理完后再去

---

#include<iostream>
#include<cstdio>
typedef long long ll;
const int INF=1e9;
using namespace std;

ll ts, tf, t;
int n;
ll a[100000];
ll best = INF;
ll ans = 0;

int main() 
{
    cin>>ts>>tf>>t;
    scanf("%d", &n);
    for(int i=0;i<n;i++) scanf("%I64d",&a[i]);
    if(!n)
    {
        cout << ts << endl;
        return 0;
    }
    if(a[0]) 
    {
        best = ts - (a[0] - 1);
        ans = min(ts, a[0] - 1);
    }
    ll ctime = max(ts, a[0]) + t;
    for(int i = 1; i < n; ++i) 
    {
        if(ctime + t > tf)
            break;
        if(a[i] > a[i - 1]) 
        {
            if(a[i] - 1 >= ctime) 
            {
                cout << ctime << endl;
                return 0;
            }
            if(ctime - a[i] + 1 < best) 
            {
                best = ctime - a[i] + 1;
                ans = a[i] - 1;
            }
        }
        ctime=max(ctime, a[i])+t;
    }
    if(ctime+t<=tf)
    {
        best= 0;
        ans = ctime;
    }
    cout << ans << endl;
    return 0;
}