【BZOJ1023】【SHOI2008】仙人掌图 cactus （仙人掌，DP）

Description

求仙人掌直径（两点间的最短路径最长）。

---

Solution

对于圆圆边，直接转移。
对于每一个环，我们维护一个单调队列。由于必须是最短路径，也就是从环上的一点走到另一点时必须走较短的一侧，所以当队首与当前点的距离大于$size/2$时，将队首弹出，用当前队首更新答案，计算出当前环的顶端向下的最长链即可。

---

Code

/************************************************
 * Au: Hany01
 * Date: Jul 29th, 2018
 * Prob: BZOJ1023 仙人掌图
 * Email: hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
    static int _, __; static char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 5e5 + 5, maxm = maxn << 2;

int n, m, beg[maxn], v[maxm], nex[maxm], e = 1, dfn[maxn], low[maxn], f[maxn], fa[maxn], Ans, dep[maxn], clk;

inline void add(int uu, int vv) { v[++ e] = vv, nex[e] = beg[uu], beg[uu] = e; }

inline void Solve(int u, int anc) {
    static int lst[maxn << 1], tot; tot = 0;
    static deque<int> q; while (!q.empty()) q.pop_back();
    for (register int t = u; t != fa[anc]; t = fa[t]) lst[++ tot] = t;
    For(i, 1, tot) lst[tot + i] = lst[i];
    For(i, 1, tot << 1) {
        while (!q.empty() && i - q.front() > (tot >> 1)) q.pop_front();
        if (!q.empty()) chkmax(Ans, f[lst[i]] + f[lst[q.front()]] + i - q.front());
        while (!q.empty() && f[lst[q.back()]] - q.back() < f[lst[i]] - i) q.pop_back();
        q.push_back(i);
    }
    for (register int t = u; t != anc; t = fa[t])
        chkmax(f[anc], f[t] + min(dep[t] - dep[anc], dep[u] - dep[t] + 1));
}

void DFS(int u) {
    dfn[u] = low[u] = ++ clk;
    for (register int i = beg[u]; i; i = nex[i]) if (v[i] != fa[u]) {
        if (!dfn[v[i]]) fa[v[i]] = u, dep[v[i]] = dep[u] + 1, DFS(v[i]), chkmin(low[u], low[v[i]]);
        else chkmin(low[u], dfn[v[i]]);
        if (low[v[i]] > dfn[u]) chkmax(Ans, f[u] + f[v[i]] + 1), chkmax(f[u], f[v[i]] + 1);
    }
    for (register int i = beg[u]; i; i = nex[i])
        if (u != fa[v[i]] && dfn[u] < dfn[v[i]]) Solve(v[i], u);
}

int main()
{
#ifdef hany01
    freopen("bzoj1023.in", "r", stdin);
    freopen("bzoj1023.out", "w", stdout);
#endif

    static int uu, vv, m, t;

    n = read(), m = read();
    while (m --) for (t = read(), uu = read(); -- t; )
        vv = read(), add(uu, vv), add(vv, uu), uu = vv;
    DFS(1), printf("%d\n", Ans);

    return 0;
}