传送门
题意
分析
参考了大佬的博客,直呼妙哉
我们去构造
c
i
=
b
i
−
a
i
c_i = b_i - a_i
ci=bi−ai,那么我们要做的,就是对这个子序列进行
+
1
,
−
1
,
+
1
,
−
1......
+1,-1,+1,-1......
+1,−1,+1,−1......的操作,最后满足
∑
c
i
=
0
\sum c_i = 0
∑ci=0
我们把这个序列看成有左右括号组成的序列,那么,删除操作就是每次删除一个左括号一个右括号,所以一开始序列的状态一定是合法的,最少要删除最多少次呢,其实就是这个序列前缀和的最大值,具体可以自己证明一下
前缀和最大值可以用线段树或者
s
t
st
st表处理
代码
#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 all(x) (x).begin(),(x).end()
#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 ll INF = 0x3f3f3f3f3f3f3f3f;
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;}
ll a[N],b[N],c[N];
int n,q;
struct Node{
int l,r;
ll mi,mx;
}tr[N * 4];
void build(int u,int l,int r){
tr[u] = {l,r};
if(l == r){
tr[u].mi = tr[u].mx = c[l];
return;
}
int mid = (l + r) >> 1;
build(u << 1,l,mid),build(u << 1 | 1,mid + 1,r);
tr[u].mx = max(tr[u << 1].mx,tr[u << 1 | 1].mx);
tr[u].mi = min(tr[u << 1].mi,tr[u << 1 | 1].mi);
}
ll query_max(int u,int l,int r){
if(tr[u].l >= l && tr[u].r <= r) return tr[u].mx;
ll res = -INF;
int mid = (tr[u].l + tr[u].r) >> 1;
if(l <= mid) res = query_max(u << 1,l,r);
if(r > mid) res = max(res,query_max(u << 1 | 1,l,r));
return res;
}
ll query_min(int u,int l,int r){
if(tr[u].l >= l && tr[u].r <= r) return tr[u].mi;
ll res = INF;
int mid = (tr[u].l + tr[u].r) >> 1;
if(l <= mid) res = query_min(u << 1,l,r);
if(r > mid) res = min(res,query_min(u << 1 | 1,l,r));
return res;
}
int main() {
read(n),read(q);
for(int i = 1;i <= n;i++) read(a[i]);
for(int i = 1;i <= n;i++) read(b[i]),c[i] = b[i] - a[i];
for(int i = 1;i <= n;i++) c[i] += c[i - 1];
build(1,1,n);
while(q--){
int l,r;
read(l),read(r);
if(c[r] - c[l - 1] != 0 || query_min(1,l,r) - c[l - 1] < 0){
di(-1);
continue;
}
dl(query_max(1,l,r) - c[l - 1]);
}
return 0;
}