poj2155 Matrix 【二維樹狀數組】

來源:互聯網
上載者:User

標籤:class   blog   code   get   2014   string   

有工具在手,這題就是一個模板題,就是有點不清楚,最後問的是單個元素的值,它怎麼sum求出來的

#include <iostream>#include <cstdlib>#include <cstring>#include <cstdio>using namespace std;#define maxn 1005int c[maxn][maxn];int Row, Col;inline int Lowbit(const int &x){    return x & (-x);}int Sum(int i, int j){    int tempj, sum = 0;    while (i > 0)    {        tempj = j;        while (tempj > 0)        {            sum += c[i][tempj];            tempj -= Lowbit(tempj);        }        i -= Lowbit(i);    }    return sum;}void Update(int i, int j, int num){    int tempj;    while (i <= Row)    {        tempj = j;        while (tempj <= Col)        {            c[i][tempj] += num;            tempj += Lowbit(tempj);        }        i += Lowbit(i);    }}int main(){    #ifndef ONLINE_JUDGEfreopen("G:/1.txt","r",stdin);freopen("G:/2.txt","w",stdout);#endif    int T;scanf("%d",&T);while(T--){    memset(c,0,sizeof(c));int N,Q;scanf("%d%d",&N,&Q);getchar();Row=N;Col=N;for(int i=1;i<=Q;i++){char ques;int a,b,c,d;scanf("%c ",&ques);//getchar();if(ques=='C'){scanf("%d%d%d%d",&a,&b,&c,&d);getchar();c++;d++;Update(a,b,1);Update(c,d,1);Update(c,b,-1);Update(a,d,-1);}else if(ques=='Q'){scanf("%d%d",&a,&b);getchar();printf("%d\n",1&Sum(a,b));}}printf("\n");}}


聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.