Codeforces 746F Music in Car

Music in Car

用两个Set维护一下尺取的过程。

#include<bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mk make_pair
#define PLL pair<LL, LL>
#define PLI pair<LL, int>
#define PII pair<int, int>
#define SZ(x) ((int)x.size())
#define ull unsigned long long

using namespace std;

const int N = 2e5 + ;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + ;
const double eps = 1e-;
const double PI = acos(-);

int n, w, k, a[N], t[N];
bool flag[N];

set<PII> Set1;
set<PII> Set2;

int main() {
    scanf("%d%d%d", &n, &w, &k);
    for(int i = ; i <= n; i++) scanf("%d", &a[i]);
    for(int i = ; i <= n; i++) scanf("%d", &t[i]);
    int now = , tmp = , ans = ;
    for(int i = , j = ; i <= n; ++i){
        now += ( + t[i]) >> ;
        tmp += a[i];
        if(Set1.size() < w){
            Set1.insert(mk(t[i] >> , i));
            flag[i] = true;
        }else{
            if((*Set1.begin()).fi < (t[i] >> )){
                PII tt = *Set1.begin();
                Set1.erase(Set1.begin());
                now += tt.fi;
                flag[tt.se] = false;
                Set1.insert(mk(t[i] >> , i));
                flag[i] = true;
                Set2.insert(tt);
            }
            else{
                now += t[i] >> ;
                Set2.insert(mk(t[i] >> , i));
            }
        }
        while(now > k){
            if(flag[j]){
                now -= (t[j] + ) >> ;
                Set1.erase(mk(t[j] >>  , j));
                while(Set2.size() && (*Set2.rbegin()).se < j) Set2.erase(*Set2.rbegin());
                if(Set2.size()){
                    PII tt = *Set2.rbegin();Set2.erase(*Set2.rbegin());
                    now -= tt.fi;
                    Set1.insert(tt);
                    flag[tt.se] = true;
                }
            }
            else{
                now -= t[j];
            }
            tmp -= a[j];
            ++j;
        }
        ans = max(ans, tmp);
    }
    printf("%d\n", ans);
    return ;
}

/*
*/