题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6012
bc91的题 官方题解已经写的很清楚了,离散化其实只要用map来存就可以达到离散的目的
#include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
#define LL long long
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
map<int,LL>mp;
mp.clear();
for(int i = 0;i<n;i++)
{
int l,r,a,b,c;
scanf("%d%d%d%d%d",&l,&r,&a,&b,&c);
mp[0] += c;
mp[l<<1] += a-c;
mp[r<<1|1] += b-a;
}
LL ans = 0;
LL v = 0;
for(map<int,LL>::iterator i = mp.begin();i!=mp.end();i++)
{
v += i->second;
ans = max(ans,v);
}
printf("%lld\n",ans);
}
return 0;
}