想法-Codeforces-1238C-Standard Free2play

题目链接
题意太难懂了…之后再补思路吧，先放代码
代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 200006, maxm = (1 << 20) + 5;
int a[maxn];
int main()
{
    int t;
    scanf("%d", &t);
    while (t--)
    {
        int h, n, i;
        scanf("%d%d", &h, &n);
        for (i = 1; i <= n; i++)
        {
            scanf("%d", &a[i]);
        }
        int now = h;
        int ans = 0;
        for (i = 2; i <= n; i++)
        {
            if (a[i] < now)
                now = a[i] - 1, ans++;
            else
                ans--;
        }
        if (now == 0)
            ans--;
        printf("%d\n", ans);
    }
}