思路一:O(mlogn)
裸的线段树,维护最小值和区间修改;由于是第一次写线段树,所以不太会写。
代码:
#include<iostream>
using namespace std;
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
char * ptr=new char[50000000];
int tree[2500000],lazy[2500000],a[1000001],i;
inline void build(int node,int l,int r){
if(l==r)tree[node]=a[l];
else{
build(node<<1,l,(l+r)>>1);
build((node<<1)+1,((l+r)>>1)+1,r);
tree[node]=min(tree[node<<1],tree[(node<<1)+1]);
}
}
inline void sub(int node,int l,int r,int a,int b,int s){
if(
r<=b
&&
l>=a
){
lazy[node]+=s;
if(tree[node]<lazy[node]){
printf("-1\n%d",i+1);
exit(0);
}