[树状数组] poj 2029 Get Many Persimmon Trees#裸的二维树状数组

/**
[树状数组] poj 2029 Get Many Persimmon Trees#裸的二维树状数组
*/
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
#define N  101
#define lowbit(i) (i) & (-i)

int a[N][N];
int m,n;
void update(int x,int y)
{
    int i,j;
    for(i = x; i <= m; i += lowbit(i))
        for(j = y; j <= n; j += lowbit(j) )
            a[i][j] ++;
}
int sum(int x,int y)
{
    int i,j,ans = 0;
    for(i = x; i > 0; i -= lowbit(i))
        for(j = y ; j > 0; j -= lowbit(j))
            ans += a[i][j];
    return ans;
}
int main()
{
    int q,s,t,i,j,ans;
    while(scanf("%d",&q) == 1 && q)
    {