Codeforces 474B Worms (water problem, two points)

Test instructions: Given the number of n heaps, then there are M-words to ask you in which heap.

Analysis: This problem is a two-part problem, but there is a function, can replace write two points, Lower_bound.

The code is as follows:

#include <bits/stdc++.h>using namespace Std;typedef long long ll;const int MAXN = 1e5 + 5;int a[maxn];int main () {
  
   int N, M;    CIN >> N;    for (int i = 1; I <= n; ++i)  scanf ("%d", &a[i]);    for (int i = 2; I <= n; ++i) a[i] + = a[i-1];    Cin >> m;    int x;    while (m--) {        scanf ("%d", &x);        int t = Lower_bound (A, a+n, X)-A;        printf ("%d\n", t);    }    return 0;}
  

Codeforces 474B Worms (water problem, two points)