传送门
题目描述
分析
我们把 m a x ( c i , a j − a i ) max(c_{i},a_{j} - a_{i}) max(ci,aj−ai)转换为 c i + m a x ( 0 , a j − a i − c i ) c_{i} + max(0,a_{j} - a_{i} - c_{i}) ci+max(0,aj−ai−ci),所以 c i c_{i} ci是必须要加上的,然后我们去把每个点的 a i a_{i} ai当作高度,也就是说只有两个点之间的高度小于 c i c_{i} ci的时候可以以0代价进行转移,否则转移代价为 a j − a i − c i a_{j} - a_{i} - c_{i} aj−ai−ci,所以我们去排序,两个相邻点之间进行移动即可
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod= 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a){char c=getchar();T x=0,f=1;while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)){x=(x<<1)+(x<<3)+c-'0';c=getchar();}a=f*x;}
int gcd(int a,int b){return (b>0)?gcd(b,a%b):a;}
struct Node{
ll a,c;
bool operator <(const Node A) const{
return a < A.a;
}
}a[N];
int n;
int main(){
read(n);
ll ans = 0;
for(int i = 1;i <= n;i++) read(a[i].a),read(a[i].c),ans += a[i].c;
sort(a + 1,a + 1 + n);
ll t = 0;
for(int i = 1;i <= n;i++){
t = max(t,a[i].a + a[i].c);
if(a[i + 1].a > t) ans += a[i + 1].a - t;
}
dl(ans);
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/