hdu 4417 Super Mario 二分 log *log - > Log(log)

hdu 4417

题意 给你一个区间  问你区间内小于k的数有多少个 

实现了其中一个版本 我们知道上一题 hdu 2665的做法 能找出区间内第p大的数是什么 那么你可以二分这个p 你就知道这个第p大的数是多少 你当前的p对应的数如果比k大 说明比k小于等于的数是要小于p的 所以右边界为mid - 1 同理 否则左边界为mid + 1

这题这样外面二分就可以做了//这样在外面二分 假设做法时间复杂度是T 那就是log * T

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
const int MAX_N = 100025;
int n,m,k,cnt,arr[MAX_N],root[MAX_N],x,y;
struct node {int l,r,sum;}T[MAX_N*40];
vector<int > vt;
int getid(int x){return lower_bound(vt.begin(),vt.end(),x)-vt.begin()+1;};
void update(int l,int r,int &x,int y,int pos)
{
    T[++cnt] = T[y],T[cnt].sum++,x = cnt;
    if(l==r) return ;
    int mid = (l+r)>>1;
    if(pos<=mid) update(l,mid,T[x].l,T[y].l,pos);
    else update(mid+1,r,T[x].r,T[y].r,pos);
}
int query(int l,int r,int x,int y,int k)
{
    if(l==r) return l;
    int mid = (l+r)>>1;
    int sum = T[T[y].l].sum - T[T[x].l].sum;
    if(sum>=k) return query(l,mid,T[x].l,T[y].l,k);
    else return query(mid+1,r,T[x].r,T[y].r,k-sum);
}
int main()
{
    int t,Case = 0;
    scanf("%d",&t);
    while(t--)
    {
        printf("Case %d:\n",++Case);
        vector<int > vt_;
        swap(vt,vt_);
        cnt = 0,T[cnt].sum = T[cnt].l = T[cnt].r = 0;
        scanf("%d%d",&n,&m);
        for(int i = 1;i<=n;++i) scanf("%d",&arr[i]),vt.push_back(arr[i]);
        sort(vt.begin(),vt.end()),vt.erase(unique(vt.begin(),vt.end()),vt.end());
        for(int i = 1;i<=n;++i) update(1,n,root[i],root[i-1],getid(arr[i]));
        for(int i = 1;i<=m;++i)
        {
            scanf("%d%d%d",&x,&y,&k);
            x++,y++;
                int l = 1,r = y-x+1;
                while(l<=r)
                {
                    int mid = (l+r)>>1;
                    if(vt[query(1,n,root[x-1],root[y],mid)-1]>k) r = mid - 1;
                    else l = mid + 1;
                }
                printf("%d\n",r);
        }
    }
    return 0;
}

下面这种做法是在query 里面去二分 复杂度是 log(log)

所以推荐使用这种方法 转换的地方就是 把k离散话以后(k的离散化要注意一下)然后query是查区间内是不是有那么多数小于等于k

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
const int MAX_N = 100025;
int n,m,cnt,x,y,k,root[MAX_N],arr[MAX_N];
struct node{int l,r,sum;}T[MAX_N*40];
vector<int > vt;
int getid(int x){return lower_bound(vt.begin(),vt.end(),x)-vt.begin()+1;};
void update(int l,int r,int &x,int y,int pos)
{
    T[++cnt] = T[y],T[cnt].sum++,x = cnt;
    if(l==r) return ;
    int mid = (l+r)>>1;
    if(pos<=mid) update(l,mid,T[x].l,T[y].l,pos);
    else update(mid+1,r,T[x].r,T[y].r,pos);
}
int query(int l,int r,int x,int y,int k)
{
    if(l==r) return T[y].sum - T[x].sum;
    int mid = (l+r)>>1,ret=0;
    if(k<=mid)
    {
        ret+= query(l,mid,T[x].l,T[y].l,k);
    }
    else
    {
        ret+= T[T[y].l].sum - T[T[x].l].sum;
        ret+=query(mid+1,r,T[x].r,T[y].r,k);
    }
    return ret;
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int t,Case = 1;
    scanf("%d",&t);
    while(t--)
    {
        printf("Case %d:\n",Case++);
        vector<int > vt_;
        swap(vt,vt_);
        cnt = 0;
        T[cnt].sum = T[cnt].l = T[cnt].r = 0;
        scanf("%d%d",&n,&m);
        for(int i = 1;i<=n;++i) scanf("%d",&arr[i]),vt.push_back(arr[i]);
        sort(vt.begin(),vt.end()),vt.erase(unique(vt.begin(),vt.end()),vt.end());
        for(int i = 1;i<=n;++i) update(1,n,root[i],root[i-1],getid(arr[i]));
        for(int i = 1;i<=m;++i)
        {
            scanf("%d%d%d",&x,&y,&k);
            x++,y++;
            k = upper_bound(vt.begin(),vt.end(),k)-vt.begin();
            if(k)   printf("%d\n",query(1,n,root[x-1],root[y],k));
            else printf("0\n");
        }
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}