【POJ】2481 cow

一道柱状数组的题目，按照y从大到小排序，如果y一样的话，x从小到大排序。

柱状数组求和的话往左走，更改结点的话往右走。

模板：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<string>
#include<sstream>
#include<ctime>
using namespace std;
#define _PI acos(-1.0)
#define INF 1 << 10
#define esp 1e-6
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> pill;
/*===========================================
===========================================*/
#define MAXD 10000 + 10
int C[MAXD];
int A[MAXD];
int n;
int lowbit(int x){
    return x & -x;
}
int sum(int x){
    int ans = 0;
    while(x > 0){
        ans += C[x];
        x -= lowbit(x);
    }
    return ans;
}
void add(int x,int d){
    int ans = 0;
    while(x <= n){
        C[x] += d;
        x += lowbit(x);
    }
    return ;
}
void display(){
    for(int i = 1 ; i <= n ; i++)
        printf("%d ",A[i]);
    printf("\n");
    return;
}
int main(){
    char str[10L];
    scanf("%d",&n);
    memset(A,0,sizeof(A));
    while(scanf("%s",str) != EOF){
        if(str[0] == 'A'){
            int x,y;
            scanf("%d%d",&x,&y);
            A[x] += y;
            add(x,y);
        }
        else if(str[0] == 'S'){
            int x,y;
            scanf("%d%d",&x,&y);
            printf("[x,y] = %d\n",sum(y) - sum(x));
        }
        display();
    }
    return 0;
}

AC代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<string>
#include<sstream>
#include<ctime>
using namespace std;
#define _PI acos(-1.0)
#define INF 1 << 10
#define esp 1e-6
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> pill;
/*===========================================
===========================================*/
#define MAXD 100000 + 10
int C[MAXD];
int maxn ;
struct Node{
    int x;
    int y;
    int id;
    bool operator < (const Node &p)const{
        if(y == p.y)
            return x < p.x;
        else
            return y > p.y;
    }
}node[MAXD];
int lowbit(int x){
    return x & -x;
}
void add(int x){
    while(x <= maxn){
        C[x] ++;
        x += lowbit(x);
    }
    return ;
}
int sum(int x){
    int ans = 0;
    while(x > 0){
        ans += C[x];
        x -= lowbit(x);
    }
    return ans;
}
int main(){
    int n;
    while(scanf("%d",&n) && n){
          maxn = -1;
          int Ans[MAXD] = {0};
          memset(C,0,sizeof(C));
          for(int i = 1 ; i <= n ; i++){
            scanf("%d%d",&node[i].x,&node[i].y);
            node[i].x ++;
            node[i].y ++;
            node[i].id = i;
            maxn = max(maxn,node[i].x);
          }
          sort(node + 1,node + n + 1);
          for(int i = 1 ; i <= n ; i++){
              add(node[i].x);
              if(i > 1 && node[i].x == node[i - 1].x && node[i].y == node[i - 1].y)
                Ans[node[i].id] = Ans[node[i - 1].id];
              else
                Ans[node[i].id] = sum(node[i].x);
          }
          for(int i = 1 ; i <= n ; i++){
              printf("%d",Ans[i] - 1);
              if(i < n)
                printf(" ");
          }
          printf("\n");
    }
    return 0;
}