Submission #67785941

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
#define int long long
const int p=998244353;
int po(int a,int b) {if(b==0) return 1; if(b==1) return a; if(b%2==0) {int u=po(a,b/2);return (u*1LL*u)%p;} else {int u=po(a,b-1);return (a*1LL*u)%p;}}
int inv(int x) {return po(x,p-2);}
mt19937 rnd;
#define app push_back
#define all(x) (x).begin(),(x).end()
#ifdef LOCAL
#define debug(...) [](auto...a){ ((cout << a << ' '), ...) << endl;}(#__VA_ARGS__, ":", __VA_ARGS__)
#define debugv(v) do {cout<< #v <<" : {"; for(int izxc=0;izxc<v.size();++izxc) {cout << v[izxc];if(izxc+1!=v.size()) cout << ","; }cout <<"}"<< endl;} while(0)
#else
#define debug(...)
#define debugv(v)
#endif
#define lob(a,x) lower_bound(all(a),x)
#define upb(a,x) upper_bound(all(a),x)
#define print(x) cout<<(x)<<'\n'
#define suma(a) accumulate(all(a),0LL)
#define maxpos(a) max_element(all(a))-a.begin()
#define minpos(a) min_element(all(a))-a.begin()
#define maxa(a) *max_element(all(a))
#define mina(a) *min_element(all(a))
pair<int,vector<int> > read()
{
    int n;cin>>n;vector<int> a(n);for(int &x:a) {cin>>x;} return {n,a};
}
int stupid(vector<int> a) {
    int n=a.size();
    if(a.size()==1) return 0;
    int pos=minpos(a);
    int res=0;
    if(pos==0) {
        res=a[1]-a[0];
        a.erase(a.begin());a[0]++;
    }
    else if(pos==n-1) {
        res=a[n-2]-a[n-1];
        a.pop_back();a[n-2]++;
    }
    else if(a[pos-1]<a[pos+1]) {
        res=a[pos-1]-a[pos];
        a[pos-1]++;a.erase(a.begin()+pos);
    }
    else {
        res=a[pos+1]-a[pos];
        a[pos+1]++;a.erase(a.begin()+pos);
    }
    return res+stupid(a);
}
int solve(vector<int> a) {
    int n=a.size();
    a.insert(a.begin(),1e18);a.app(1e18);n+=2;
        vector<int> nx(n);for(int i=0;i<n;++i) nx[i]=i+1;
        vector<int> pr(n);for(int i=0;i<n;++i) pr[i]=i-1;
        set<pair<int,int> > poses;for(int i=1;i<n-1;++i) poses.insert({a[i],i});
        int ans=0;
        while(poses.size()>1) {
            auto [val,i]=(*poses.begin());
            int il=pr[i];int ir=nx[i];
            int v=min(a[il],a[ir]);
            if(val<v) {
                poses.erase(poses.begin());
                ans+=(v-val);
                a[i]=v;
                poses.insert({a[i],i});
                continue;
            }
            nx[il]=ir;pr[ir]=il;
            int ii;
            if(il==0) {ii=ir;}
            else if(ir==n-1) {ii=il;}
            else if(a[il]<=a[ir]) {ii=il;}
            else {ii=ir;}
            poses.erase({a[i],i});poses.erase({a[ii],ii});
            ans+=(a[ii]-a[i]);
            a[ii]++;
            poses.insert({a[ii],ii});
        }
        return ans;
}
int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    /*while(true) {
        vector<int> a(5);for(int &x:a) {x=rnd()%10+1;}
        int so=solve(a);int stu=stupid(a);
        if(so>stu) {
            debugv(a);
            debug(so,stu);
            exit(0);
        }
    }*/
    int t;cin>>t;
    while(t--) {
        int n;cin>>n;vector<int> a(n);for(int &x:a) {cin>>x;}
        cout<<solve(a)<<'\n';
    }
    return 0;
}

Submission Info

Judge Result