poj查询区间第k大（划分树）

题意：查询某一个区间第K大的数是什么

思路：线段树中保存的是一个对应区间的vector数组，每次合并区间的时候直接调用归并Merge函数。查询的话直接二分答案，判断是否有大于等于k个小于等于这个数的数。

复杂度是m*log(n)^3

PS :好像主席树屌一些，到时候再学学

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;
typedef unsigned long long ll;
typedef pair<int,int> P;
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define clr(x,y) memset(x,y,sizeof x)
#define PI acos(-1.0)
#define ITER set<int>::iterator
const int Mod = 1e9 + 7;
const int maxn = 1e5 + 10;

int n,m,a[maxn],b[maxn];
vector<int>g[maxn << 2];

void build(int rt,int L,int R)
{
    if(L == R){g[rt].push_back(a[L]);return ;}
    int mid = (L + R) >> 1;
    build(rt << 1 ,L,mid);build(rt << 1 | 1,mid + 1,R);g[rt].resize(R - L + 1);
    merge(g[rt << 1].begin(),g[rt << 1].end(),g[rt << 1 | 1].begin(),g[rt << 1 | 1].end(),g[rt].begin());
}
int query(int rt,int L,int R,int l,int r,int x)
{
    if(l >= L && r <= R){return upper_bound(g[rt].begin(),g[rt].end(),x) - g[rt].begin();}
    int ret = 0,mid = (l + r) >> 1;
    if(R <= mid)ret += query(rt << 1,L,R,l,mid,x);
    else if(L >= mid + 1)ret += query(rt << 1 | 1,L,R,mid + 1,r,x);
    else
        ret += query(rt << 1,L,mid,l,mid,x) + query(rt << 1 | 1,mid + 1,R,mid + 1,r,x);
    return ret;
}
void solve()
{
    while(m --)
    {
        int L,R,k;scanf("%d%d%d",&L,&R,&k);L --;R --;
        int l = 0,r = n - 1,mid,ans;
        while(l <= r)
        {
            if(query(1,L,R,0,n - 1,b[mid = (l + r) >> 1]) >= k)
                r = (ans =  mid) - 1;
            else l = mid + 1;
        }
        printf("%d\n",b[ans]);
    }
}
int main()
{
    while( ~ scanf("%d%d",&n,&m))
    {
        for(int i = 0;i <= (n << 2);i ++)g[i].clear();
        for(int i = 0; i < n; i ++)scanf("%d",&a[i]),b[i] = a[i];
        sort(b,b + n);build(1,0,n - 1);
        solve();
    }
    return 0;
}

之前写的分块没过，也放在这吧。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;
typedef unsigned long long ll;
typedef pair<int,int> P;
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define clr(x,y) memset(x,y,sizeof x)
#define PI acos(-1.0)
#define ITER set<int>::iterator
const int Mod = 1e9 + 7;
const int maxn = 1e5 + 10;
int B;

int n,m,a[maxn],b[maxn];
vector<int>g[maxn];
int L,R,k;

bool check(int x)
{
    int cnt = 0;
    while(L <= R && L % B)if(a[L ++] <= x)cnt ++;
    while(L <= R && (R + 1) % B){if(a[R --] <= x)cnt ++;}
    if(L < R )for(int i = L / B; i <= R/B;i ++)cnt += upper_bound(g[i].begin(),g[i].end(),x) - g[i].begin();
//    cout << x << " " << cnt << " " << L + 1<< " " << R + 1<< endl;
    return cnt >= k;
}
void solve()
{
    while(m --)
    {
        int _L,_R,_k;scanf("%d%d%d",&_L,&_R,&_k);
        int l = 0,r = n - 1,mid,ans;
        while(l <= r)
        {
            L = _L - 1,R = _R - 1,k = _k;
            if(check(b[mid = (l + r) >> 1]))
                r = (ans =  mid) - 1;
            else l = mid + 1;
        }
        printf("%d\n",b[ans]);
    }
}
int main()
{
    while( ~ scanf("%d%d",&n,&m))
    {
//        B = sqrt(n) + 1;
        B = 1000;
        for(int i = 0;i <= n;i ++)g[i].clear();
        for(int i = 0; i < n; i ++)scanf("%d",&a[i]),g[i / B].push_back(a[i]),b[i] = a[i];
        for(int i = 0; i <= n/B + 1; i ++)sort(g[i].begin(),g[i].end());sort(b,b + n);
        solve();
    }
    return 0;
}