Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- struct FenwickTree {
- vector <int> t;
- FenwickTree(vector <int>& a) {
- t.resize(a.size(), 0);
- for (int i = 0; i < a.size(); i++) {
- update(i, a[i]);
- }
- }
- void update(int i, int d) {
- while (i < t.size()) {
- t[i] += d;
- i = (i | (i + 1));
- }
- }
- int get_p(int i) {
- int result = 0;
- while (i >= 0) {
- result += t[i];
- i = (i & (i + 1)) - 1;
- }
- return result;
- }
- int get(int l, int r) {
- return get_p(r) - get_p(l - 1);
- }
- };
- int main() {
- int n;
- cin >> n;
- vector <int> a(n);
- for (int i = 0; i < n; i++) {
- cin >> a[i];
- }
- FenwickTree tree(a);
- int k;
- cin >> k;
- for (int i = 0; i < k; i++) {
- int l, r;
- cin >> l >> r;
- cout << tree.get(l - 1, r - 1) << '\n';
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement