D. Cyclic MEX_d - cyclic mex-CSDN博客

文章讨论了给定一个由0到n-1的唯一整数组成的排列p，计算其所有可能循环移位中mex值的最大成本。mex函数用于找出一个数组中未出现的最小正整数。

For an array $a$ , define its cost as $∑i=1nmex⁡†([a1,a2,…,ai])\sum_{i=1}^{n} \operatorname{mex} ^\dagger ([a_1,a_2,\ldots,a_i])$ .

You are given a permutation $‡^\ddagger$ $p$ of the set ${0,1,2,…,n−1}\{0,1,2,\ldots,n-1\}$ . Find the maximum cost across all cyclic shifts of $p$ .

$†mex⁡([b1,b2,…,bm])^\dagger\operatorname{mex}([b_1,b_2,\ldots,b_m])$ is the smallest non-negative integer $x$ such that $x$ does not occur among $b1,b2,…,bmb_1,b_2,\ldots,b_m$ .

$‡^\ddagger$ A permutation of the set ${0,1,2,...,n-1\}$ is an array consisting of $n$ distinct integers from $0$ to $n - 1$ in arbitrary order. For example, $[1, 2, 0, 4, 3]$ is a permutation, but $[0, 1, 1]$ is not a permutation ( $1$ appears twice in the array), and $[0, 2, 3]$ is also not a permutation ( $n = 3$ but there is $3$ in the array).
Input

Each test consists of multiple test cases. The first line contains a single integer $t$ ( $\le t \le 10^5$ ) — the number of test cases. The description of the test cases follows.

The first line of each test case contains a single integer $n$ ( $\le n \le 10^6$ ) — the length of the permutation $p$ .

The second line of each test case contain $n$ distinct integers $p1,p2,…,pnp_1, p_2, \ldots, p_n$ ( $KaTeX parse error: Expected 'EOF', got '&' at position 11: 0 \le p_i &̲lt; n$ ) — the elements of the permutation $p$ .

It is guaranteed that sum of $n$ over all test cases does not exceed $10^6$ .
Output

For each test case, output a single integer — the maximum cost across all cyclic shifts of $p$ .

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
const int N = 1e6+10;
LL a[N];
bool vis[N];
void slove()
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++)cin>>a[i];
    memset(vis,0,n + 10);
    LL s=0;
    deque<PII> q;
    for(LL i=0,j=0;i<n;i++)
    {
        vis[a[i]]=true;
        while(vis[j])j++;
        q.push_back({j,1});
        s+=j;
    }
    LL ret=0;
    for(int i=0;i<n;i++)
    {
        s-=q.front().first;
        if(--q.front().second==0)q.pop_front();
        LL cnt=0;
        while(!q.empty()&&q.back().first>a[i])
        {
            s-=q.back().first*q.back().second;
            cnt+=q.back().second;
            q.pop_back();
        }
        s+=a[i]*cnt+n;
        q.push_back({a[i],cnt});
        q.push_back({n,1});
        ret=max(ret,s);
    }
    cout<<ret<<endl;
}
int main()
{
    int t;
    cin>>t;
    while(t--)slove();
}