思路:
树形DP,dp[i]=min(dp[j]+(sum[i]-sum[j])^2+p) (j是i的祖先即j<i) ,用斜率将复杂度由O(n^2)优化为O(n)。
此外,在pop的时候可以二分,会更优一些。
但是感觉写起来有点麻烦,这个题不二分的话,时间也稳稳地不会T的。
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<stack>
using namespace std;
const int N=1e5+100;
const int M=2e5+100;
long long sum[N];
long long dp[N];
long long ans;
long long p;
int head[N];
int cnt;
struct node
{
int op;//1-pu_f 2-pu_b 3-po_f 4-po_b
int x;
node(){}
node(int op,int x):op(op),x(x){}
}now;
deque<int> q;
stack<node> s;
struct edge
{
int v;
long long w;
int next;
}e[M];
void init()
{
cnt=0;
ans=0;
memset(head,-1,sizeof(head));
while(!q.empty())
q.pop_back();
while(!s.empty())
s.pop();
}
void add(int u,int v,long long w)
{
e[cnt].v=v;
e[cnt].w=w;
e[cnt].next=head[u];
head[u]=cnt++;
}
void dfs(int cur,int fa)
{
if(cur!=1)
{
dp[cur]=dp[q.front()]+(sum[cur]-sum[q.front()])*(sum[cur]-sum[q.front()])+p;
while(q.size()>=2&&dp[q[1]]+(sum[cur]-sum[q[1]])*(sum[cur]-sum[q[1]])+p<dp[cur])
{
dp[cur]=dp[q[1]]+(sum[cur]-sum[q[1]])*(sum[cur]-sum[q[1]])+p;
s.push(node(3,q.front()));
q.pop_front();
}
ans=max(ans,dp[cur]);
while(q.size()>=2&&(dp[cur]+sum[cur]*sum[cur]-(dp[q.back()]+sum[q.back()]*sum[q.back()]))*2*(sum[q.back()]-sum[q[q.size()-2]])
<(dp[q.back()]+sum[q.back()]*sum[q.back()]-(dp[q[q.size()-2]]+sum[q[q.size()-2]]*sum[q[q.size()-2]]))*2*(sum[cur]-sum[q.back()]))
{
s.push(node(4,q.back()));
q.pop_back();
}
s.push(node(2,cur));
q.push_back(cur);
}
int ss=s.size();
for(int i=head[cur];i!=-1;i=e[i].next)
{
if(e[i].v!=fa)
{
sum[e[i].v]=sum[cur]+e[i].w;
dfs(e[i].v,cur);
while(s.size()>ss)
{
now=s.top();
s.pop();
if(now.op==1)
q.pop_front();
else if(now.op==2)
q.pop_back();
else if(now.op==3)
q.push_front(now.x);
else
q.push_back(now.x);
}
}
}
}
int main()
{
int t;
int n;
int u,v;
long long w;
scanf("%d",&t);
while(t--)
{
scanf("%d%lld",&n,&p);
init();
for(int i=1;i<n;++i)
{
scanf("%d%d%lld",&u,&v,&w);
add(u,v,w);
add(v,u,w);
}
dp[1]=-p;
sum[1]=0;
q.push_back(1);
dfs(1,-1);
printf("%lld\n",ans);
}
return 0;
}