uva 12003 块状链表

先分块。对于查询，块内排好序二分，对于修改，直接暴力，注意需要维护原来的有序性，不断和块内相邻元素交换即可。

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

const int N = 300000;
const int M = 650;
int a[N];
int b[M][M];
int n, m, u, ps, num;

void modify( int pos, int val )
{
    int cur = pos / ps;
    if ( cur < num - 1 )
    {
        int p = lower_bound( b[cur], b[cur] + ps, a[pos] ) - b[cur];
        while ( p + 1 < ps && b[cur][p + 1] < val ) 
        {
            b[cur][p] = b[cur][p + 1];
            p++;
        }
        while ( p - 1 >= 0 && b[cur][p - 1] > val )
        {
            b[cur][p] = b[cur][p - 1];
            p--;
        }
        b[cur][p] = val;
    }
    a[pos] = val;
}

void update( int l, int r, int v, int p )
{
    int cur = l / ps, ncur = r / ps, k = 0;
    if ( cur != ncur )
    {
        for ( int i = cur + 1; i <= ncur - 1; i++ )
        {
            k += lower_bound( b[i], b[i] + ps, v ) - b[i];
        }
        for ( int i = l; i < ( cur + 1 ) * ps; i++ )
        {
            if ( a[i] < v ) k++;
        }
        for ( int i = ncur * ps; i <= r; i++ )
        {
            if ( a[i] < v ) k++;
        }
    }
    else
    {
        for ( int i = l; i <= r; i++ )
        {
            if ( a[i] < v ) k++;
        }
    }
    modify( p, u * 1ll * k / ( r - l + 1 ) );
}

int main ()
{
    while ( scanf("%d%d%d", &n, &m, &u) != EOF )
    {
        ps = 600;
        for ( int i = 0; i < n; i++ )
        {
            scanf("%d", &a[i]);
            b[i / ps][i % ps] = a[i];
        }
        num = ( n + ps - 1 ) / ps;
        for ( int i = 0; i < num - 1; i++ )
        {
            sort( b[i], b[i] + ps );
        }
        while ( m-- )
        {
            int l, r, v, p;
            scanf("%d%d%d%d", &l, &r, &v, &p);
            l--, r--, p--;
            update( l, r, v, p );
        }
        for ( int i = 0; i < n; i++ )
        {
            printf("%d
", a[i]);
        }
    }
    return 0;
}