树状数组-前缀和

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include <algorithm>
#include<cstring>
#include<math.h>
#include<map>
#include<queue>
#include<set>
#include<vector>
using namespace std;
typedef long long ll;
const int N = 1000100;
int n, m, k, res, ans, sum;
int h[N],s[N],g[N];
int lowbit(int x)
{
return x & -x;
}
int add(int x, int k)
{
for (int i = x; i <= n; i += lowbit(i))
h[i] += k;
}
int query(int l, int r)
{
for (int i = r; i; i -= lowbit(i))
ans += h[i];
for (int i = l - 1; i; i -= lowbit(i))
ans -= h[i];
return 0;
}
void solve()
{
memset(h, 0, sizeof h);
}
int main()
{
int T = 1;
cin >> T;
while (T--)
{
solve();
}
return 0;
}