Submission #72906636

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);

    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        vector<int> row(n + 1);
        // 每一列的最低位置的最高(min)就是最优解
        vector<int> lowest(n + 1, n);
        for (int i = 1; i <= n; i++)
        {
            // 第i列棋子的行位置
            cin >> row[i];
            lowest[i] = row[i];
        }

        for (int i = 1; i <= n; i++)
        {
            int idx = 1;
            int lower = row[i] + idx;
            while (i - idx >= 1)
            { // 左侧最优解
                if (lower >= lowest[i - idx])
                { // 已经有更小的，直接结束
                    break;
                }
                lowest[i - idx] = lower;
                lower++;
                idx++;
            }
            idx = 1;
            lower = row[i] + idx;
            while (i + idx <= n)
            { // 右侧最优解
                if (lower >= lowest[i + idx])
                {
                    break;
                }
                lowest[i + idx] = lower;
                lower++;
                idx++;
            }
        }
        long long ans = 0;
        for (int i = 1; i <= n; i++)
        {
            if (row[i] <= lowest[i])
            {
                continue;
            }
            ans += row[i] - lowest[i];
        }
        cout << ans << '\n';
    }

    return 0;
}

Submission Info

Judge Result