fork(1) download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6. inline int power(int a, int b) {
  7. int x = 1;
  8. while (b) {
  9. if (b & 1) x *= a;
  10. a *= a;
  11. b >>= 1;
  12. }
  13. return x;
  14. }
  15.  
  16.  
  17. const int M = 1000000007;
  18. const int N = 3e5+9;
  19. const int INF = 2e9+1;
  20. const int LINF = 2000000000000000001;
  21.  
  22. //_ ***************************** START Below *******************************
  23.  
  24. vector<int> a;
  25.  
  26.  
  27. void consistency(int n, int m, vector<int>& q){
  28.  
  29. vector<int> prefix(n, 0);
  30. prefix[0] = a[0];
  31. for(int i=1; i<n; i++){
  32. prefix[i] = prefix[i-1] + a[i];
  33. }
  34.  
  35. for(int i=0; i<m; i++){
  36. auto it = lower_bound(begin(prefix), end(prefix), q[i]) - begin(prefix);
  37.  
  38. cout << it+1 << endl;
  39. }
  40.  
  41.  
  42. }
  43.  
  44. void solve() {
  45.  
  46. int n;
  47. cin>>n;
  48. a.resize(n);
  49. for(int i=0; i<n; i++) cin >> a[i];
  50. int m;
  51. cin >> m;
  52. vector<int> q(m);
  53. for(int i=0; i<m; i++) cin >> q[i];
  54. consistency(n, m, q) ;
  55. cout << endl;
  56.  
  57.  
  58. }
  59.  
  60.  
  61.  
  62.  
  63.  
  64. int32_t main() {
  65. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  66.  
  67. int t = 1;
  68. cin >> t;
  69. while (t--) {
  70. solve();
  71. }
  72.  
  73. return 0;
  74. }
Success #stdin #stdout 0.01s 5276KB
stdin
3
5
2 7 3 4 9
3
1 25 11
6
1 1 1 1 1 1
3
2 4 1
1
5
5
1 2 3 4 5
stdout
1
5
3

2
4
1

1
1
1
1
1