刷题系列——2021年11月版

图论

有向图的强连通分量

tarjan 应用：将有向图转化成有向无环图，针对新图每个点的入度和出度进行分析即可。

1.ACwing367——tarjan

入度为 0 的点有多少，答案就是多少；入度出度最大的结点数量。特判：如果只有一个结点，答案为 0。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 207;
int h[N], e[N], ne[N], cnt, n;
int stk[N], in_stk[N], top, dfn[N], low[N], id[N], din[N], dout[N], scc_cnt, timestep;
void init() {
    cnt = scc_cnt = 0;
    memset(h, -1, sizeof(h));
}
void add(int u, int v) {
    e[cnt] = v, ne[cnt] = h[u], h[u] = cnt++;
}
void tarjan(int u) {
    dfn[u] = low[u] = ++timestep;
    stk[top++] = u, in_stk[u] = 1;
    for (int i = h[u]; ~i; i = ne[i]) {
        int vv = e[i];
        if (!dfn[vv]) {
            tarjan(vv);
            low[u] = min(low[u], low[vv]);
        } else if (in_stk[vv]) low[u] = min(low[u], dfn[vv]);
    }
    if (dfn[u] == low[u]) {
        while (top) {
            int vv = stk[--top];
            in_stk[vv] = 0;
            id[vv] = scc_cnt;
            if (dfn[vv] == low[vv]) break;
        }
        scc_cnt++;
    }
}
int main() {
    scanf("%d", &n);
    init();
    for (int i = 1; i <= n; i++) {
        int x;
        while (scanf("%d", &x) && x) add(i, x);
    }
    for (int i = 1; i <= n; i++) if(!dfn[i]) tarjan(i);
    for (int u = 1; u <= n; u++) {
        for (int i = h[u]; ~i; i = ne[i]) {
            int vv = e[i], a = id[u], b = id[vv];
            if (a != b) dout[a]++, din[b]++;
            // printf("%d->%d  a=%d b=%d\n", u, vv, a, b);
        }
    }
    // for (int i = 1; i <= n; i++) {
    //     printf("id[%d]=%d\n", i, id[i]);
    // }
    int in_cnt = 0, out_cnt = 0;
    for (int i = 0; i < scc_cnt; i++) {
        if (!din[i]) in_cnt++;
        if (!dout[i]) out_cnt++;
        // printf("din[%d]=%d dout[%d]=%d\n", i, din[i], i, dout[i]);
    }
    if (scc_cnt == 1) puts("1\n0");
    else printf("%d\n%d\n", in_cnt, max(in_cnt, out_cnt));
    return 0;
}

2.ACwing1175——tarjan、DAGDP

要注意倒着枚举强连通分量，因为序号越大的强连通分量越大，结点越靠前，被搜到的时间越早，即可认为是 DP 的初态，正着枚举会出问题，原因就在于先传递终态，无法满足子结构优先，答案没等更新就再也更新不到这个结点了。

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <unordered_set>
using namespace std;
typedef long long ll;
const int N = 2e6+7, M = 1e5+7;
int h[M], e[N], ne[N], cnt, hs[M], n, m, mod;
int stk[M], top, timestep, dfn[M], low[M], id[M], Size[M], scc_cnt;
bool in_stk[M];
int dp[M], f[M];
void init() {
    cnt = timestep = 0;
    memset(h, -1, sizeof h);
    memset(hs, -1, sizeof hs);
}
void add(int h[], int u, int v) {
    e[cnt] = v, ne[cnt] = h[u], h[u] = cnt++;
}
void tarjan(int u) {
    dfn[u] = low[u] = ++timestep;
    stk[top++] = u, in_stk[u] = true;
    for (int i = h[u]; ~i; i = ne[i]) {
        int vv = e[i];
        if (!dfn[vv]) {
            tarjan(vv);
            low[u] = min(low[u], low[vv]);
        } else if (in_stk[vv]) low[u] = min(low[u], dfn[vv]);
    }
    if (dfn[u] == low[u]) {
        while (top) {
            int vv = stk[--top];
            in_stk[vv] = false;
            id[vv] = scc_cnt;
            Size[scc_cnt]++;
            if (dfn[vv] == low[vv]) break;
        }
        scc_cnt++;
    }
}
ll Hash(int u, int v) {
    return 1ll*u*1e6 + v;
}
int main() {
    scanf("%d%d%d", &n, &m, &mod);
    init();
    while (m--) {
        int a, b;
        scanf("%d%d", &a, &b);
        add(h, a, b);
    }
    for (int i = 1; i <= n; i++) if (!dfn[i]) tarjan(i);
    unordered_set<ll> st;
    for (int u = 1; u <= n; u++) {
        for (int i = h[u]; ~i; i = ne[i]) {
            int vv = e[i], a = id[u], b = id[vv];
            if (a != b) {
                ll ha = Hash(a, b);
                if (st.count(ha)) continue;
                st.insert(ha);
                add(hs, a, b);
            }
        }
    }
    for (int u = scc_cnt - 1; u >= 0; u--) {
        if (!dp[u]) {
            dp[u] = Size[u];
            f[u] = 1;
        }
        for (int i = hs[u]; ~i; i = ne[i]) {
            int vv = e[i];
            if (dp[u] + Size[vv] > dp[vv]) {
                dp[vv] = dp[u] + Size[vv];
                f[vv] = f[u];
            } else if (dp[u] + Size[vv] == dp[vv]) {
                f[vv] = (f[vv] + f[u]) % mod;
            }
        }
    }
    int maxf = 0, ans = 0;
    for (int i = 0; i < scc_cnt; i++) {
        if (dp[i] > maxf) {
            maxf = dp[i];
            ans = f[i];
        }
        else if (dp[i] == maxf) {
            ans = (ans + f[i]) % mod;
        }
    }
    printf("%d\n%d\n", maxf, ans);
    return 0;
}

数据结构

树套树

1.ACwing2488—区间前缀、树套树（线段树+set）

加哨兵！！

#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
#include <algorithm>
using namespace std;
const int N = 4*5e4+7, INF = 1e9;
struct tree{
    int l, r;
    multiset<int> s;
}tr[N];
int w[N], n, m;
void build(int x, int l, int r) {
    tr[x] = {l, r};
    tr[x].s.insert(-INF), tr[x].s.insert(INF);
    for (int i = l; i <= r; i++) tr[x].s.insert(w[i]);
    if (l == r) return ;
    int mid = (l+r)>>1;
    build(x<<1, l, mid);
    build(x<<1|1, mid+1, r);
}
void change(int x, int p, int v) {
    tr[x].s.erase(tr[x].s.find(w[p]));
    tr[x].s.insert(v);
    if (tr[x].l == tr[x].r) return ;
    int mid = (tr[x].l + tr[x].r)>>1;
    if (p <= mid) change(x<<1, p, v);
    else change(x<<1|1, p, v);
}
int query(int x, int l, int r, int v) {
    if (l <= tr[x].l && r >= tr[x].r) {
        auto t = tr[x].s.lower_bound(v);
        return *(--t);
    }
    int mid = (tr[x].l + tr[x].r)>>1, ans = -INF;
    if (l <= mid) ans = max(ans, query(x<<1, l, r, v));
    if (r > mid) ans = max(ans, query(x<<1|1, l, r, v));
    return ans;
}
int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
    build(1, 1, n);
    while (m--) {
        int op, pos, l, r, x;
        scanf("%d", &op);
        if (op == 1) {
            scanf("%d%d", &pos, &x);
            change(1, pos, x);
            w[pos] = x;
        }
        else {
            scanf("%d%d%d", &l, &r, &x);
            printf("%d\n", query(1, l, r, x));
        }
    }
    return 0;
}