Codeforces 975C

题意略。

思路：这题考察的是二分搜索。

#include<bits/stdc++.h>
#define maxn 200005
using namespace std;
typedef long long LL;
 
LL n,q;
LL ai[maxn],ki[maxn];
 
int main(){
    scanf("%lld%lld",&n,&q);
    for(int i = ;i < n;++i) scanf("%lld",&ai[i]);
    for(int i = ;i <= q;++i) scanf("%lld",&ki[i]);
 
    for(int i = ;i < n;++i) ai[i] += ai[i - ];
 
    LL sum = ;
    for(int i = ;i <= q;++i){
        sum += ki[i];
        int die = upper_bound(ai,ai + n,sum) - ai;
        int live = n - die;
        if(live == ){
            live = n;
            sum = ;
        }
        printf("%d\n",live);
    }
    return ;
}