昨晚写了一发很不优雅
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define p_q priority_queue
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define inf 0x3f3f3f3f
const int mod =1e9+7;
const int p_mod=998244353;
#define forn(i,n) for(int (i)=1;(i)<=(n);(i)++)
#define forn0(i,n) for(int (i)=0;(i)<(n);(i)++)
#define vii vector<pair<int ,int >>
#define vi vector<int>
#define pii pair<int,int>
#define DBG 0
#define debug(x) cout<<#x<<" is "<<x<<endl
#define pw(x) (1LL<<(x))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
/*1.be able to use template [Multiset] skillful
function parameter is double type:ceil() floor()
__gcd() */
ll fast_pow(ll a,ll b){
ll res=1;
while(b){
if(b&1)res=(res*a)%mod;
b>>=1;
a=(a*a)%mod;
}
return res%mod;
}
const int N=1e5+5;
int root[N],n;
void make_set(){
for(int i=1;i<=n;i++)root[i]=i;}
int find_set(int x){
return root[x]==x?root[x]:root[x]=find_set(root[x]);}
bool union_set(int x,int y){
x=find_set(x);
y=find_set(y);
if(x==y)return false;
return root[y]=root[x];
}
void fail(bool flag){
if(flag){
puts("NO");exit(0);}else cout<<"YES"<<endl;}
multiset<int> differ;
set<int>s;
ll sum = 0;
vector<int> ans;
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
#if DBG
freopen("input.txt","r",stdin);
#endif
int q;
cin>>n>>q;
for(int i = 1;i <= n;i++){
int x;
cin>>x;
s.insert(x);
}
set<int>::iterator it;
int pre = -1;
for(it = s.begin();it !=s.end();it++){
if(pre != -1){
differ.insert(*it - pre);
sum += *it - pre;
}
pre = (*it);
}
//debug(differ.size());
if(differ.size() > 1)
ans.pb(sum - *(--differ.end()));
else
ans.pb(0);
for(int i = 1;i <= q;i++){
int query,x;
cin>>query>>x;
if(query == 0){
set<int>::iterator it = s.find(x),it1,it2;
if(it != s.begin()){
it1 = --it;
++it;
differ.erase(differ.find(*it - *it1));
sum -=*it - *it1;
}
if(++it != s.end()){
it2 = it;
differ.erase(differ.find(*it2 - x));
sum -=*it2 - x;
}
--it;
if(it !=s.begin() && ++it !=s.end()){
differ.insert(*it2 - *it1),sum +=*it2 - *it1;
}
s.erase(x);
}else{
s.insert(x);
set<int>::iterator it = s.find(x),it1,it2;
if(it != s.begin()){
it1 = --it;
++it;
differ.insert(*it - *it1);
sum +=*it - *it1;
}
if(++it != s.end()){
it2 = it;
differ.insert(*it2 - x);
sum += *it2 - x;
}
--it;
if(it !=s.begin() && ++it !=s.end())
differ.erase(differ.find(*it2 - *it1)),sum -= *it2 - *it1;
}
/*
cout<<"differ : ";
for(auto it = differ.begin();it!= differ.end();it++){
cout<<(*it)<<" ";
}
cout<<endl;
*/
if(differ.size() > 1)
ans.pb(sum - *(--differ.end()));
else
ans.pb(0);
}
for(int i =0;i < ans.size();i++){
cout<<ans[i]<<endl;
}
return 0;
}
看了土神的做法,学会了用prev和next
#include<bits/stdc++.h>
#define debug(x) cout<<#x<<" is "<<x<<endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define DBG 0
const int N = 1e5 + 5;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const ll LLINF = (1LL<<60);
using namespace std;
typedef pair<int,int> pii;
set<int> s;
multiset<int> d;
ll sum = 0;
void add(int x){
s.insert(x);
auto it = s.find(x);
if(it != s.begin()){
sum += *it - *prev(it);
d.insert(*it - *prev(it));
}
if(next(it) != s.end()){
sum += *next(it) - *it;
d.insert(*next(it) - *it);
}
if(it != s.begin() && next(it) != s.end()){
sum -= *next(it) - *prev(it);
//debug(*next(it) - *prev(it));
auto it1 = d.find(*next(it) - *prev(it));
d.erase(it1);
}
}
void del(int x){
auto it = s.find(x);
if(it != s.begin()){
int a = *it - *prev(it);
auto it1 = d.find(a);
sum -= a;
d.erase(it1);
}
if(next(it) != s.end()){
auto it1 = d.find(*next(it) - *it);
sum -= *next(it) - *it;
d.erase(it1);
}
if(next(it) != s.end() && it != s.begin()){
sum += *next(it) - *prev(it);
d.insert(*next(it) - *prev(it));
}
s.erase(it);
}
void print_ans(){
if(d.size() > 1)
cout<<sum - *prev(d.end())<<endl;
else
cout<<0<<endl;
}
void check(){
for(auto i =d.begin();i != d.end();i++)
debug(*i);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#if DBG
freopen("input.txt","r",stdin);
#endif
int n,q;
cin>>n>>q;
for(int i = 1;i <= n;i++){
int x;
cin>>x;
add(x);
}
print_ans();
for(int i = 1;i <= q;i++){
int query,x;
cin>>query>>x;
if(query == 1){
add(x);
}else del(x);
// check();
print_ans();
}
return 0;
}