Array and Segments (Hard version)【Codeforces Round #535 (Div. 3).E2】

题目链接

---

  每次的区间更新都可以去做一个区间全体‘-1’，但是这是可以取也可以不取的，所以，我们可以取搞一个O(N*M*logN)的枚举来找寻最后的答案，就是去遍历每一个节点，把所有在区间内的都直接放进来，然后去找全体区间最大值，最后比较即可。

  听闻还有用可持久化线段树做的（就是附近的大佬…… 呜呜呜，膜拜……QAQ）。

---

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
#include <ctime>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 1e5 + 7;
int N, M, tree[maxN<<2], lazy[maxN<<2], op, val[maxN];
set<int> st, need;
vector<int> vt[maxN];
struct node
{
    int l, r, id;
    node(int a=0, int b=0, int c=0):l(a), r(b), id(c) {}
    friend bool operator <(node e1, node e2)
    {
        return e1.l < e2.l;
    }
}a[maxN];
vector<node> las[maxN];
void pushup(int rt) { tree[rt] = max(tree[lsn], tree[rsn]); }
void buildTree(int rt, int l, int r)
{
    lazy[rt] = 0;
    if(l == r)
    {
        tree[rt] = val[l];
        return;
    }
    int mid = HalF;
    buildTree(Lson);
    buildTree(Rson);
    pushup(rt);
}
void pushdown(int rt)
{
    if(lazy[rt])
    {
        tree[lsn] += lazy[rt];
        tree[rsn] += lazy[rt];
        lazy[lsn] += lazy[rt];
        lazy[rsn] += lazy[rt];
        lazy[rt] = 0;
    }
}
void update(int rt, int l, int r, int ql, int qr, int val)
{
    if(ql <= l && qr >= r)
    {
        tree[rt] += val;
        lazy[rt] += val;
        return;
    }
    pushdown(rt);
    int mid = HalF;
    if(qr <= mid) update(QL, val);
    else if(ql > mid) update(QR, val);
    else { update(QL, val); update(QR, val); }
    pushup(rt);
}
int main()
{
    scanf("%d%d", &N, &M);
    for(int i=1; i<=N; i++) scanf("%d", &val[i]);
    buildTree(1, 1, N);
    for(int i=1; i<=M; i++)
    {
        scanf("%d%d", &a[i].l, &a[i].r);
        a[i].id = i;
    }
    if(N == 1) { printf("0\n0\n"); return 0; }
    sort(a + 1, a + M + 1);
    for(int i=1; i<=M; i++) vt[a[i].r + 1].push_back(i);
    int pos = 1, ans = 0;
    for(int i=1; i<=N; i++)
    {
        int len = (int)vt[i].size();
        for(int j=0; j<len; j++)
        {
            int id = vt[i][j];
            int l = a[id].l, r = a[id].r;
            update(1, 1, N, l, r, 1);
            st.erase(a[id].id);
        }
        while(pos<=M && a[pos].l <= i)
        {
            update(1, 1, N, a[pos].l, a[pos].r, -1);
            st.insert(a[pos++].id);
        }
        int ti = (int)st.size();
        int temp = tree[1] - val[i] + ti;
        if(temp > ans)
        {
            ans = temp;
            need = st;
        }
    }
    printf("%d\n", ans);
    op = (int)need.size();
    printf("%d\n", op);
    int shu = 0;
    if(op)
    {
        for(auto it = need.begin(); it != need.end(); it++)
        {
            shu++;
            int id = *it;
            printf("%d%c", id, shu == op?'\n':' ');
        }
    }
    return 0;
}