【离散化树状数组】Nordic Collegiate Programming Contest G.Galactic Collegiate Programming Contest

 #include<bits/stdc++.h>
 using namespace std;
 typedef long long ll;
 int n,m;
 const int maxn=1e5+;
 struct node
 {
     int team;
     int num;
     int time;
     int id;
 }a[maxn];
 int ans[maxn];
 int b[maxn];
 int c[maxn];
 int s[maxn];
 int team[maxn];
 int tree[maxn];
 int pre[maxn];
 int lowbit(int x)
 {
     return x&(-x);
 }
 void add(int k,int x)
 {
     while(k<=m)
     {
         tree[k]+=x;
         k+=lowbit(k);
     }
 }
 int query(int k)
 {
     int res=;
     while(k)
     {
         res+=tree[k];
         k-=lowbit(k);
     }
     return res;
 }

 bool cmp(node x,node y)
 {
     if(x.num!=y.num) return x.num>y.num;
     else if(x.time!=y.time) return x.time<y.time;
     else if(x.team!=) return false;
     //else return true;
 }
 int main()
 {
     while(~scanf("%d%d",&n,&m))
     {
         memset(b,,sizeof(b));//题数
         memset(c,,sizeof(c));//罚时数
         memset(tree,,sizeof(tree));
         memset(ans,,sizeof(ans));
         memset(pre,,sizeof(pre));
         int tmp;
         for(int i=;i<=m;i++)
         {
             scanf("%d%d",&a[i].team,&tmp);
             a[i].num=b[a[i].team]+;
             b[a[i].team]=a[i].num;
             a[i].time=c[a[i].team]+tmp;
             c[a[i].team]=a[i].time;
             a[i].id=i;
             team[i]=a[i].team;
         }
         sort(a+,a++m,cmp);
         for(int i=;i<=m;i++)
         {
             s[a[i].id]=i;
         }
         for(int i=;i<=m;i++) pre[team[i]]=-;
         int r=m;
         for(int i=;i<=m;i++)
         {
             if(pre[team[i]]!=-)
                 add(pre[team[i]],-);
             pre[team[i]]=s[i];
             if(team[i]==)
                 r=s[i]-;
             add(s[i],);
             ans[i]=query(r)+;
         }
         for(int i=;i<=m;i++) cout<<ans[i]<<endl;

     }
     return ;
 }

注意自定义cmp,最后没有return 导致wa

http://codeforces.com/gym/101572/attachments/download/6091/20172018-acmicpc-nordic-collegiate-programming-contest-ncpc-2017-en.pdf