poj 2886 线段树

首先要打表找出1-N中因数最多的数K保存起来

然后每次在求的时候直接着第K个跳出的即可

然后num【root】表示l到r还有多少人未跳出

因为每次剩余的个数知道，moves【i】知道，所一可以求出此次是要求当前未跳出的人中间的第几个，找出其编号即可

然后一直循环K次

AC代码如下：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;

int id[37] = { 1, 2, 4, 6, 12,
            24, 36, 48, 60, 120,
            180, 240, 360, 720, 840,
            1260, 1680, 2520, 5040, 7560,
            10080, 15120, 20160, 25200, 27720,
            45360, 50400, 55440, 83160, 110880,
            166320, 221760, 277200, 332640, 498960,
            510000, 510000 };
int cnt[37] = { 1, 2, 3, 4, 6,
                8, 9, 10, 12, 16,
                18, 20, 24, 30, 32,
                36, 40, 48, 60, 64,
                72, 80, 84, 90, 96,
                100, 108, 120, 128, 144,
                160, 168, 180, 192, 200 };

int N, start;
int num[2000000];
char s[500100][12];
int moves[500100];

int lc( int root ){
    return 2 * root;
}

int rc( int root ){
    return 2 * root + 1;
}

void updata( int root ){
    num[root] = num[lc(root)] + num[rc(root)];
}

void built( int l, int r, int root ){
    if( l == r ){
        num[root] = 1;
        return;
    }
    int mid = ( l + r ) / 2;
    built( l, mid, lc(root) );
    built( mid + 1, r, rc(root) );
    updata( root );
}

void insert( int pos, int l, int r, int root ){
    if( l == r ){
        num[root] = 0;
        return;
    }
    int mid = ( l + r ) / 2;
    if( pos <= mid ){
        insert( pos, l, mid, lc(root) );
    }else{
        insert( pos, mid + 1, r, rc(root) );
    }
    updata( root );
}

int query( int L, int R, int l, int r, int root ){
    if( L <= l && R >= r ){
        return num[root];
    }
    int ans = 0;
    int mid = ( l + r ) / 2;
    if( L <= mid ){
        ans += query( L, R, l, mid, lc(root) );
    }
    if( R > mid ){
        ans += query( L, R, mid + 1, r, rc(root) );
    }
    return ans;
}

int query_( int pos, int l, int r, int root ){
    if( l == r ){
        num[root] = 0;
        return l;
    }
    int mid = ( l + r ) / 2, ans = 0;
    if( num[lc(root)] >= pos ){
        ans = query_( pos, l, mid, lc(root) );
    }else{
        ans = query_( pos - num[lc(root)], mid + 1, r, rc(root) );
    }
    updata( root );
    return ans;
}

int main(){
    while( scanf( "%d%d", &N, &start ) != EOF ){
        for( int i = 1; i <= N; i++ ){
            scanf( "%s%d", s[i], &moves[i] );
        }
        built( 1, N, 1 );
        int ans = 1, step;
        for( int i = 0; i < 35; i++ ){
            if( N >= id[i] && N < id[i+1] ){
                ans = cnt[i];
                step = id[i];
            }
        }
        insert( start, 1, N, 1 );
        int ansid = start;
        for( int i = 2; i <= step; i++ ){
            int temp = query( 1, ansid, 1, N, 1 );
            int pos;
            if( moves[ansid] > 0 ){
                moves[ansid] %= ( N - i + 1 );
                pos = ( temp + moves[ansid] ) % ( N - i + 1 );
                if( pos == 0 ){
                    pos = N - i + 1;
                }
            }else{
                moves[ansid] = -moves[ansid] - 1;
                moves[ansid] %= ( N - i + 1 );
                pos = ( temp + ( N - i + 1 ) - moves[ansid] ) % ( N - i + 1 );
                if( pos == 0 ){
                    pos = N - i + 1;
                }
            }
            ansid = query_( pos, 1, N, 1 );
        }
        cout << s[ansid] << " " << ans << endl;
    }
    return 0;
}