传送门
害,题目不好懂啊,这里我推荐一位大佬代码,我只是稍作补充
大佬博客
他并没有介绍为什么在前缀和的位置那里要是i+1,个人感觉不好理解,来补充一下
就在代码里,自己看吧
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <map>
#include <string>
#include <cstring>
#include <cmath>
#include <stack>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define sc(a) scanf("%lld",&a)
#define pf(a) printf("%d",a)
#define endl "\n"
#define int long long
#define mem(a,b) memset(a,b,sizeof a)
#define ull unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define inf 0x3f3f3f3f
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define x first
#define y second
const double eps = 1e-6;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const int N = 100010;//首先看一下数据范围
int h[N][2];
unordered_map<int, int> diffs;
vector<pair<int, int>> v;
signed main()
{
int n;
cin>>n;
int x;char g[2];
for(int i=1;i<=n;i++)
{
cin>>x>>g;
if(g[0] == 'G')
v.push_back({x, -1});
else
v.push_back({x, 1});
}
sort(v.begin(), v.end());
// for(int i=0; i<n; ++i)
// {
// if(v[i].y == 0)
// {
// h[i][0] = h[i-1][0] + 1;
// h[i][1] = h[i-1][1];
// }
// else
// {
// h[i][1] = h[i-1][1] + 1;
// h[i][0] = h[i-1][0];
// }
// }
diffs[0] = v[0].first; //diffs[0] = 0;
int sum = 0, H = 2e9, G = 2e9, ansh = 0, ansg = 0, ans2 = 0;
for(int i = 0; i < n; i++)
{
int k = v[i].first, a = v[i].second;
//求只有一种牛的最大照片长度
if(a == 1) H = min(H, k), ansh = max(ansh, k - H), G = 2e9;
else G = min(G, k), ansg = max(ansg, k - G), H = 2e9;
//求两种牛长度一样的最大照片长度
sum += a;
if(diffs.find(sum) == diffs.end()) diffs[sum] = v[i + 1].first;//sum没出现过,这是第一次出现
//至于为什么是v[i+1]其实很简单,手动推一下,你就会发现,加上第i个之后
//它才是中间G和H相等,所以要从下一个开始算,一定要手动推
else ans2 = max(ans2, k - diffs[sum]);//出现过就用当前值减去第一次出现的值
}
cout << max({ansh, ansg, ans2})<<endl;
return 0;
}