ACM/ICPC2018北京网赛-hihocoder #1831 80 Days(暴力/尺取

题意:

一个环 每次到一个点会得到一个值,和失去一个值 期间的值不能为小于0
直接暴力线段树为何差值的前缀和即可
尺取两个对着扫

#include <bits/stdc++.h>
using namespace std;

#define cpp_io() {ios::sync_with_stdio(false); cin.tie(NULL);}
#define rep(i,a,n) for (int i=a;i<n;i++)
#define repp(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define CLR(a,b) memset(a,(b),sizeof(a))
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ls o<<1
#define rs o<<1|1


typedef long long ll;
typedef vector<int> VI;
const int MAXN = (int)2e6+10;
const int INF = 0x3f3f3f3f;
const int mod = (int)1e9+7;

void F() {
    #ifndef ONLINE_JUDGE
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
}
int a[MAXN],b[MAXN],c[MAXN];
struct node {
    int l,r,x;
}t[MAXN<<2];
void build(int l,int r,int o){
    t[o].l=l,t[o].r=r;
    if(l==r){
        t[o].x=c[l]; return;
    }
    int mid=(l+r)>>1;
    build(l,mid,ls); build(mid+1,r,rs);
    t[o].x=min(t[ls].x,t[rs].x);
}
inline int query(int l,int r,int o){
    if(t[o].l>=l&&t[o].r<=r) return t[o].x;
    int mid=(t[o].l+t[o].r)>>1;
    if(r<=mid) return query(l,r,ls);
    else if(l>mid) return query(l,r,rs);
    else return min(query(l,mid,ls),query(mid+1,r,rs));
}
int main(int argc, char const *argv[])
{
    cpp_io(); F();
    int T; cin>>T;
    while(T--){
        int n,k; cin>>n>>k;
        int x1=0,x2=0;
        repp(i,1,n)cin>>a[i],x1+=a[i];
        repp(i,1,n)cin>>b[i],x2+=b[i];
        if(x1-x2+k<0) {
            cout<<-1<<endl;
            continue;
        }
        repp(i,1,n)c[i]=c[i-1]+a[i]-b[i];
        bool flag=false;
        build(1,n,1);
        repp(i,1,n) {
            int x=query(i,n,1);
            if(x+k-c[i-1]>=0) {
                cout<<i<<endl; flag=true; break;
            }
        }
        if(!flag) cout<<-1<<endl;
    }

    return 0;
}