Codeforces Round 975 (Div. 2)

题目

题解：

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
#define ll long long
#define pii pair<int, int>

const int maxn = 1e6 + 5, inf = 2e18, maxm = 4e4 + 5, base = 37;
const int N = 1e6;
const int mod = 1e9 + 7;
// const int mod = 998244353;
// const __int128 mod = 212370440130137957LL;

int n, m;

//long long ? maxn ? n? m?
void solve(){
    ll res = 0;
    int k, q;
    cin >> n;
	vector<int> a(n + 1), l(n + 1), r(n + 1);
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		if(!l[a[i]]) l[a[i]] = i;
		r[a[i]] = i;
	}
	int L = 1, R = n;//答案区间
	int lt = n, rt = 1;//包含所有a[i] <= t的最小区间
	for(int t = 1; t <= n; t++){
		if(!l[t]) continue;
		lt = min(lt, l[t]);
		rt = max(rt, r[t]);
		if(rt - lt + 1 > t){
			cout << 0 << '\n';
			return;
		}
		int dif = t - (rt - lt + 1);//剩多少时间占领 a[i] > t的城市
		L = max(L, lt - dif);
		R = min(R, rt + dif);
	}
	cout << R - L + 1 << '\n';
}
    
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed << setprecision(9);
    
    int T = 1;
    cin >> T;
    while (T--){
        solve();
    }
    return 0;
}