题意:传送门
题解:做了这个传送门后,就知道这个题只需要稍微改动改动,将距离改改就过了,最后边界再稍微处理下就过了,略板。
附上代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e6+5;
ll n;
struct node{
ll t,r,m;
node(ll t=0,ll r=0):t(t),r(r){}
};
node sta[maxn];
bool cmp(node a,node b)
{
return a.t>b.t;
}
struct point{
ll x,y;
point(ll x=0,ll y=0):x(x),y(y){}
};
point q[maxn];
int head,tail;
ll multi(point o,point a,point b)
{
return (a.x-o.x)*(b.y-o.y)-(a.y-o.y)*(b.x-o.x);
}
ll dp[maxn];
ll sumt[maxn],sum[maxn];
int main()
{
scanf("%lld",&n);
ll mx=0;
for(int i=1;i<=n;i++){
scanf("%lld%lld%lld",&sta[i].t,&sta[i].r,&sta[i].m);
mx=max(mx,sta[i].t);
}
for(int i=1;i<=n;i++){
sta[i].t=mx-sta[i].t;
}
sort(sta+1,sta+n+1,cmp);
for(int i=1;i<=n;i++){
sum[i]=sum[i-1]+sta[i].r;
sumt[i]=sumt[i-1]+sta[i].r*sta[i].t;
}
dp[0]=0;
head=tail=0;
q[tail++]=point(0,0);
for(int i=1;i<=n;i++){
while(head+1<tail&&q[head].y+sta[i].t*q[head].x>=q[head+1].y+sta[i].t*q[head+1].x){
head++;
}
dp[i]=q[head].y+sta[i].t*q[head].x+sumt[i]-sta[i].t*sum[i]+sta[i].m;
point p=point(sum[i],dp[i]-sumt[i]);
while(head+1<tail&&multi(q[tail-2],q[tail-1],p)<0){
tail--;
}
q[tail++]=p;
}
printf("%lld\n",dp[n]);
return 0;
}