rt, WA 了一个点，求助

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
typedef long long LL;
LL a[N], last[N];
int main()
{
    int n, c, ans = 0;
    cin >> n >> c;
    for (int i = 1; i <= n; i++)cin >> a[i];
    for (int i = 1; i <= n; i++)
    {
        last[i] = a[last[i - 1]] > a[i] ? last[i - 1] : i;
        // cout << "last[" << i << "] = " << last[i] << endl;
        ans = a[last[ans]] + c * (n - ans) >=
            a[last[i]] + c * (n - i) ? i : ans;
        // cout << a[ans] + c * (n - ans) << " "
        //     << a[last[i]] + c * (n - i) << endl;
    }
    cout << ans << " " << a[last[ans]] + c * (n - ans);
    return 0;
}