flag[i] = 1;
Dfs(next,0);
temp = max(temp,power[i][0]);
power[next][0] = dp[next][0];
power[next][1] = dp[next][1];
power[next][0] += dp[i][1];
power[next][1] += dp[i][1] + arr[i].g;
Dfs(next,1);
ans += max(temp,power[i][1]);
}
printf("%lld\n",ans);
}
}
作者：woshi250hua