题目来源于牛客竞赛:https://ac.nowcoder.com/acm/contest/discuss
题目描述:
输入描述:
输出描述:
示例1:
题解:
代码:
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef unsigned long long ull;
typedef long double ld;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> pbds;
const int N = 311111;
ll M[N+11];
ll C[N+11];
void add_m(int l, int r, ll v)
{
if(l>r) return ;
M[l]+=v; M[r+1]-=v;
}
void add_c(int l, int r, ll v)
{
if(l>r) return ;
C[l]+=v; C[r+1]-=v;
}
vector<ii> vec;
const ll INF = ll(7e18);
ii getrange(ll x, ll y)
{
int l = lower_bound(vec.begin(),vec.end(),mp(x,-100LL))-vec.begin();
int r = lower_bound(vec.begin(),vec.end(),mp(y+1,-100LL))-vec.begin();
r--;
return mp(l,r);
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin>>n;
ll tot=0;
for(int i=0;i<n;i++)
{
ll l,r; cin>>l>>r;
tot+=r-l;
l*=2; r*=2;
vec.pb({(l+r)/2, (r-l)/2});
}
sort(vec.begin(),vec.end());
for(int i=0;i<n;i++)
{
ll M=vec[i].fi; ll L=vec[i].se;
ii tmp = getrange(-INF,M-L);
add_c(tmp.fi,tmp.se,L);
tmp=getrange(M-L+1,M);
add_m(tmp.fi,tmp.se,-1);
add_c(tmp.fi,tmp.se,M);
tmp=getrange(M+1,M+L-1);
add_m(tmp.fi,tmp.se,1);
add_c(tmp.fi,tmp.se,-M);
tmp=getrange(M+L,INF);
add_c(tmp.fi,tmp.se,L);
}
for(int i=1;i<N+10;i++)
{
M[i]+=M[i-1]; C[i]+=C[i-1];
}
ll ans=INF;
for(int i=0;i<n;i++)
{
ans=min(ans,M[i]*vec[i].fi+C[i]);
}
cout<<tot-ans<<'\n';
}
更多问题,更详细题解可关注牛客竞赛区,一个刷题、比赛、分享的社区。
传送门:https://ac.nowcoder.com/acm/contest/discuss