提出 #72870751

---

ソースコード 拡げる

#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N = 2e5 + 10;
int dx[]{-1, 0, 1, 0};
int dy[]{0, 1, 0, -1};

void solve()
{
    int n, t;
    cin >> n >> t;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++)
        cin >> a[i];

    int ans = 0;
    int next = 0;
    for (int i = 1; i <= n; i++)
    {
        if (next <= a[i])
        {
            ans += a[i] - next;
            next = a[i] + 100;
        }
        else
            continue;
    }
    ans += max(0ll, t - next);
    cout << ans << "\n";
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    // cin >> T;
    while (T--)
        solve();

    return 0;
}

提出情報

ジャッジ結果