Submission #54564625

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

typedef long long ll;
typedef tree<pair<ll, ll>, null_type, less<pair<ll, ll>>, rb_tree_tag, tree_order_statistics_node_update>  ordered_set;
// member functions : order_of_key(k){no_of_ele < k} find_by_order(k){kth ele}

const ll M = 998244353;
const ll N = 2e5 + 69;
const ll lmax = 2e18;
const ll lmin = -2e18;
//  ... --- ... 

// --------------------------------------------------------------

// --------------------------------------------------------------

void solve()
{
    ll n, a; cin >> n >> a;
    vector<ll> v(n);
    for(int i = 0; i < n; i++)
        cin >> v[i];
    ll curr_end = 0;
    for(int i = 0; i < n; i++)
    {
        if(v[i] >= curr_end)
        {
            curr_end = v[i] + a;
        }
        else
        {
            curr_end += a;
        }
        cout << curr_end << endl;
    }
}

int main()
{
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    solve();
    return 0;
}

Submission Info

Judge Result