Codeforces Round #263 (Div. 1) C. Appleman and a Sheet of Paper 树状数组暴力更新

C. Appleman and a Sheet of Paper

 

 

Appleman has a very big sheet of paper. This sheet has a form of rectangle with dimensions 1 × n. Your task is help Appleman with folding of such a sheet. Actually, you need to perform q queries. Each query will have one of the following types:

1. Fold the sheet of paper at position pi. After this query the leftmost part of the paper with dimensions 1 × pi must be above the rightmost part of the paper with dimensions 1 × ([current width of sheet] - pi).
2. Count what is the total width of the paper pieces, if we will make two described later cuts and consider only the pieces between the cuts. We will make one cut at distance li from the left border of the current sheet of paper and the other at distance ri from the left border of the current sheet of paper.

Please look at the explanation of the first test example for better understanding of the problem.

Input

The first line contains two integers: n and q (1  ≤ n ≤ 105; 1 ≤ q ≤ 105) — the width of the paper and the number of queries.

Each of the following q lines contains one of the described queries in the following format:

• "1 pi" (1 ≤ pi < [current width of sheet]) — the first type query.
• "2 li ri" (0 ≤ li < ri ≤ [current width of sheet]) — the second type query.

Output

For each query of the second type, output the answer.

input

7 4
1 3
1 2
2 0 1
2 1 2

output

4
3
思路： 暴力更新， 然后用FenwickTree 或者SegmentTree进行区间求和即可。
因为每个位置上的value只会更新到别的位置一次，所以暴力的话复杂度也是O(n)， 然后更新的时候分两种情况， 如果折过去的长度大于右边界 就相当于把右面的对应长度折过来， 否则就是题目中所说的从左面折了。
我用ua, ub,维护了当前区间的左右端点， 每次查询也分两种情况。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
namespace FenwickTree {
int arr[maxn];
void Modify(int x, int d) {
    while(x < maxn) {
        arr[x] += d;
        x += x & -x;
    }
}
void init(int n) {
    memset(arr, 0, sizeof arr);
    for(int i = 1; i <= n; i++) {
        Modify(i, 1);
    }
}
int query(int x) {
    int res = 0;
    while (x > 0) {
        res += arr[x];
        x -= x & -x;
    }
    return res;
}
}
int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
#endif
    int n, q;
    while (~ scanf ("%d%d", &n, &q)) {
        int tot = 0, direction = 0;
        FenwickTree::init(n);
        int ub = n;
        for (int j = 0; j < q; j++) {
            int op, l, r, p;
            int ua = tot+1;
            scanf ("%d", &op);
            if (op == 1) {
                scanf ("%d", &p);
                if (!direction) {
                    if (2*p <= 1 + ub - ua) {
                        for (int i = ua; i <= ua+p-1; i++) {
                            FenwickTree::Modify(2*ua+2*p-i-1, FenwickTree::query(i) - FenwickTree::query(i-1));
                        }
                        tot += p;
                    } else {
                        p = ub - (ua + p-1);
                        for (int i = ub; i >= ub-p+1; i--) {
                            FenwickTree::Modify(2*ub-2*p+1-i, FenwickTree::query(i) - FenwickTree::query(i-1));
                        }
                        ub = ub - p;
                        direction ^= 1;
                    }
                }else{
                    if (2*p > 1 + ub - ua){
                        p = ub - (ua + p-1);
                        for (int i = ua; i <= ua+p-1; i++) {
                            FenwickTree::Modify(2*ua+2*p-i-1, FenwickTree::query(i) - FenwickTree::query(i-1));
                        }
                        direction ^= 1;
                        tot += p;
                    }else{
                        for (int i = ub; i >= ub-p+1; i--) {
                            FenwickTree::Modify(2*ub-2*p+1-i, FenwickTree::query(i) - FenwickTree::query(i-1));
                        }
                        ub = ub - p;
                    }
                }

            } else {
                scanf ("%d%d", &l, &r);
                if (!direction) {
                    printf("%d\n", FenwickTree::query(ua+r-1)-FenwickTree::query(ua-1+l));
                }else{
                    printf("%d\n", FenwickTree::query(ub-l)-FenwickTree::query(ub-r));
                }
            }
        }
    }
    return 0;
}