蓝桥杯2022年第十三届省赛 C组 - 重新排序

 

 

贪心+差分 +前缀和。a的最大值应该分配给区间重叠部分最多的。然后根据区间分成若干部分。一次for就可以了。时间复杂度为排序： O(nlogn)

#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
typedef long long LL;
typedef pair<int,int>pii;
const int mod = 1e9 + 7 , INF = 0x3f3f3f3f , N = 1e5 + 10;

int n;
int a[N];

struct edge
{
    int v; //权重
    int l,r;
    
    bool operator < (const edge & w)const
    {
        return v > w.v;
    }
}e[N];
int cnt;
int d[N];
int b[N];
LL s[N];
LL s2[N];
pii query[N];
int main()
{
    cin >> n;
    LL sum = 0;
    for (int i = 1 ; i <= n ; i ++)
        cin >> a[i],s[i] = s[i - 1] + a[i];
    
    int m;
    cin >> m;
    for (int i = 1 ; i <= m ; i ++)
    {
        int l,r;
        cin >> l >> r;
        query[i] = {l,r};
        sum += s[r] - s[l - 1];
        d[l] ++;
        d[r + 1] --;
    }
    for (int i = 1 ; i <= n ; i ++)
        d[i] += d[i - 1];
    for (int i = 1 ; i <= n ; i ++)
    {
        int j = i + 1;
        
        while (j <= n && d[j] == d[i])
            j ++;
        j --;
        e[++ cnt] = {d[j],i,j};
        i = j;
    }
    sort(a + 1,a + 1 + n);
    sort(e + 1,e + 1 + cnt);
    int t = n;
    for (int i = 1 ; i <= cnt ; i ++)
    {
        for (int j = e[i].l ; j <= e[i].r ; j ++)
            b[j] = a[t --];
    }
    LL sum2 = 0;
    for (int i = 1 ; i <= n ; i ++)
        s2[i] = s2[i - 1] + b[i];
        
    for (int i = 1 ; i <= m ; i ++)
    {
        int l = query[i].first;
        int r = query[i].second;
        sum2 += s2[r] - s2[l - 1];
    }
    cout << sum2 - sum;
    
    return 0;
    
}