Submission #1301423

---

Source Code Expand

#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <climits>
#include <bitset>
#include <functional>
#include <numeric>
#include <ctime>
#include <cassert>
#include <cstring>
#include <fstream>

#define FOR(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#define IFOR(i, a, b) for(int (i)=(a);(i)<=(b);(i)++)
#define RFOR(i, a, b) for(int (i)=(a);(i)>=(b);(i)--)

using namespace std;

int main() {
    int n, t;
    cin >> n >> t;
    int a;
    cin >> a;
    int now = a;
    int cnt = 0;
    FOR(i, 1, n) {
        int a;
        cin >> a;
        if (a - now >= t)
            cnt += t;
        else
            cnt += a - now;
        now = a;
    }
    cnt += t;
    cout << cnt << endl;
    return 0;
}

Submission Info

Judge Result