环套树

• P1453
• 先把环处理出来，然后对环上每个节点树形DP，然后环形DP就好

//#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)

template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

const int N = 200005;
int n, p[N], head[N], cnt;
double k;
struct node
{
    int next, t;
}edge[N << 1];
void add (int f, int t)
{
    edge[cnt].t = t;
    edge[cnt].next = head[f];
    head[f] = cnt ++;
}
int dfn[N], path[N], times;
int vertex[N], circle[N], tot, dp[N][2], f[N][2];
void dfs1 (int u ,int id)
{
    dfn[u] = ++ times;
    for(int i = head[u] ; i != -1; i = edge[i].next)
    {
        int v = edge[i].t;
        if(i != id)
        {
            if (!dfn[v])
                path[v] = u, dfs1(v,i^1);//前向星选手都懂
            else if (dfn[v] > dfn[u])//tarjan原理
            {
                for(int j = v ; j != u ; j = path[j])
                    vertex[++ tot] = j , circle[j] = 1;
                vertex[++ tot] = u , circle[u] = 1;
            }
        }
    }
}
void dfs2 (int u, int fa)
{
    dp[u][1] = p[u];
    for (int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t;
        if (v != fa && !circle[v])
        {
            dfs2 (v, u);
            dp[u][1] += dp[v][0];
            dp[u][0] += max(dp[v][1], dp[v][0]);
        }
    }
}
int main()
{
    read (n);
    mem(head,-1);
    for (int i = 0 ; i < n ; i ++)
        read (p[i]);
    for (int i = 1 ; i <= n ; i ++)
    {
        int u , v;
        read (u, v);
        add (u , v);
        add (v , u);
    }
    scanf ("%lf",&k);
    dfs1 (1, -1);
    for (int i = 1 ; i <= tot ; i ++)
        dfs2(vertex[i], -1);
    for (int i = 1 ; i <= tot ; i ++)
        vertex[i + tot] = vertex[i];
    int ans = 0;
    mem(f,-0x3f);
    f[1][0] = dp[vertex[1]][0];
    for (int i = 2 ; i <= tot ; i ++)
    {
        f[i][1] = f[i-1][0]+dp[vertex[i]][1];
        f[i][0] = max(f[i-1][0],f[i-1][1])+dp[vertex[i]][0];
    }
    ans = max (f[tot][0], f[tot][1]);
    mem(f,-0x3f);
    f[1][1] = dp[vertex[1]][1];
    for (int i = 2 ; i <= tot ; i ++)
    {
        f[i][1] = f[i-1][0] + dp[vertex[i]][1];
        f[i][0] = max(f[i-1][0],f[i-1][1]) + dp[vertex[i]][0];
    }
    ans = max(ans, f[tot][0]);
    printf("%.1lf\n",ans*k);
}
/*
4
1 2 2 3
0 1 3 1
1 2 3 2
 */