Array Transformer UVA

Array Transformer

UVA - 12003

 白书p393

#include <bits/stdc++.h>
using namespace std;
const int maxn = 300010;
const int size = 4096;

int n, m, u, a[maxn], bk[maxn / size + 1][size];

void init(){
    scanf("%d %d %d", &n, &m, &u);
    int b = 0, j = 0;
    for(int i = 0; i  < n; i++){
        scanf("%d", &a[i]);
        bk[b][j] = a[i];
        if(++j == size) {
            b++; j = 0;
        }
    }
    for(int i = 0; i < b; i++) sort(bk[i], bk[i] + size);
    if(j) sort(bk[b], bk[b] + j);
}

int query(int l, int r, int v){
    int lb = l / size, rb = r / size;
    int k = 0;
    if(lb == rb) {
        for(int i = l; i <= r; i++) if(a[i] < v) k++;
    }else{
        for(int i = l; i < (lb + 1) * size; i++) if(a[i] < v) k++;
        for(int i = rb * size; i <= r; i++) if(a[i] < v) k++;
        for(int b = lb + 1; b < rb; b++){
            k += lower_bound(bk[b], bk[b] + size, v) - bk[b];
        }
    }
    return k;
}

void change(int p, int x){
    if(a[p] == x) return;
    int old = a[p], pos = 0, *B = &bk[p / size][0];
    a[p] = x;
    while(B[pos] < old) pos++;
    B[pos] = x;
    if(x > old) while(pos < size - 1 && B[pos] > B[pos + 1]) swap(B[pos], B[pos + 1]), pos++;
    else while(pos > 0 && B[pos] < B[pos - 1]) swap(B[pos], B[pos - 1]), pos--;
}

int main(){
    init();
    while(m--){
        int l, r, v, p;
        scanf("%d %d %d %d", &l, &r, &v, &p);
        l--; r--; p--;
        int k = query(l, r, v);
        change(p, (long long)u * k / (r - l + 1));
    }
    for(int i = 0; i < n; i++) printf("%d
", a[i]);
    return 0;
}