1521. War Games 2(线段树解约瑟夫）

1521

根据区间和 来确定第k个数在哪

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<stdlib.h>
 using namespace std;
 #define N 100010
 int s[N<<],tt;
 void up(int w)
 {
     s[w] = s[w<<]+s[w<<|];
 }
 void build(int l,int r,int w)
 {
     if(l==r)
     {
         s[w] = ;
         return ;
     }
     int m = (l+r)>>;
     build(l,m,w<<);
     build(m+,r,w<<|);
     up(w);
 }
 void update(int k,int l,int r,int w)
 {
     if(l==r)
     {
         s[w] = ;
         tt = l;
         return ;
     }
     int m = (l+r)>>;
     if(k<=s[w<<])
     update(k,l,m,w<<);
     else
     update(k-s[w<<],m+,r,w<<|);
     up(w);
 }
 int getsum(int a,int b,int l,int r,int w)
 {
     if(a<=l&&b>=r)
     {
         return s[w];
     }
     int m = (l+r)>>,re=;
     if(a<=m)
     re+=getsum(a,b,l,m,w<<);
     if(b>m)
     re+=getsum(a,b,m+,r,w<<|);
     return re;
 }
 int main()
 {
     int k,n,o=,ss=;
     scanf("%d%d",&n,&k);
     build(,n,);
     int m = n;
     while(n)
     {
         if(tt)
         {
             ss = getsum(,tt,,m,);
             o = (k+ss)%s[];
         }
         else
         o = k%s[];
         if(o==)
         o=s[];
         update(o,,m,);
         n--;
         if(n)
         printf("%d ",tt);
         else
         printf("%d\n",tt);
     }
     return ;
 }