Gym 100971D Laying Cables 单调栈

Description

One-dimensional country has n cities, the i-th of which is located at the point x_i and has population p_i, and all x_i, as well as all p_i, are distinct. When one-dimensional country got the Internet, it was decided to place the main server in the largest city, and to connect any other city j to the city k that has bigger population than j and is the closest to it (if there are many such cities, the largest one should be chosen). City k is called a parent of city j in this case.

Unfortunately, the Ministry of Communications got stuck in determining from where and to where the Internet cables should be laid, and the population of the country is suffering. So you should solve the problem. For every city, find its parent city.

Input

The first line contains a single integer n(1 ≤ n ≤ 200000) — the number of cities.

Each of the next n lines contains two space-separated integers x_i and p_i(1 ≤ x_i,  p_i ≤ 10⁹) — the coordinate and the population of thei-th city.

Output

Output n space-separated integers. The i-th number should be the parent of the i-th city, or  - 1, if the i-th city doesn't have a parent. The cities are numbered from 1 by their order in the input.

Sample Input

4
1 1000
7 10
9 1
12 100

-1 4 2 1

 

题意：

　　 给你n个点在x轴上的位置x和权值pos 

　　对于一个第i点 他的父亲定义为 和他最近并且 权值大于p[i]的 为点

　　输出每个点父亲，没有满足的作其父亲的点输出-1；

题解：

　　单调栈预处理出第i个点左边的父亲，和右边的父亲，去最近，权值最大的一个

　　作一遍RMQ，二分左边的父亲是谁，最优解是最靠近的点

 

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+, M = 1e6+, mod = 1e9+, inf = 2e9;
typedef long long ll;

int n,ans[N];
struct ss{long long x,p;int id;}a[N],lefts[N],rights[N];
vector<ss> G;
bool cmp(ss s1,ss s2) {return s1.x<s2.x;}

int main(){
    scanf("%d",&n);
    for(int i=;i<=n;i++) scanf("%I64d%I64d",&a[i].x,&a[i].p),a[i].id = i;
    sort(a+,a+n+,cmp);
    a[].x=-inf, a[].p = inf; a[].id = -;
    G.push_back(a[]);
    for(int i=;i<=n;i++) {
        while(G.back().p<=a[i].p) G.pop_back();
        lefts[i]=G.back();
        G.push_back(a[i]);
    }
    G.clear();
    a[n+] = (ss) {inf,inf,-};
    G.push_back(a[n+]);
    for(int i=n;i>=;i--) {
        while(G.back().p<=a[i].p) G.pop_back();
        rights[i]=G.back();
        G.push_back(a[i]);
    }

    for(int i=;i<=n;i++) {
        if(abs(lefts[i].x-a[i].x)==abs(rights[i].x-a[i].x)) {
            if(lefts[i].p>rights[i].p) ans[a[i].id] = lefts[i].id;
            else ans[a[i].id] = rights[i].id;
        }
        else if(abs(lefts[i].x-a[i].x)<abs(rights[i].x-a[i].x)) {
           ans[a[i].id] = lefts[i].id;
        }
        else ans[a[i].id] = rights[i].id;
    }
    for(int i=;i<=n;i++) printf("%d ",ans[i]);
    printf("\n");
}

单调栈

 

 

#include<bits/stdc++.h>
using namespace std;
const int N = 2e5+, M = 1e6+, mod = 1e9+, inf = 2e9;
typedef long long ll;

int n;
ll dp[N][];
int ans[N];

struct ss{long long  x,p;int id;}a[N],lefts[N],rights[N];

bool cmp(ss s1,ss s2) {return s1.x<s2.x;}
ll cal(int l,int r)
{
    if(l==r) return a[l].p;
    int k = (int) (log((double) r-l+) / log(2.0));
    return max(dp[l][k], dp[r - (<<k) + ][k]);
}
int main() {
    scanf("%d",&n);
    for(int i=;i<=n;i++) scanf("%I64d%I64d",&a[i].x,&a[i].p), a[i].id=i;
    sort(a+,a+n+,cmp);
    a[] = (ss) {-inf,inf,-};
    a[n+] = (ss){inf,inf,-};
      for(int i=;i<=n+;i++) dp[i][] = a[i].p;
    for(int j=;(<<j)<=n+;j++) {
        for(int i=;i + (<<j) -  <= n+; i++) {
            if(dp[i][j-] > dp[i+(<<(j-))][j-])
                dp[i][j] =  dp[i][j-];
            else {
                 dp[i][j] =  dp[i+(<<(j-))][j-];
            }
        }
    }
    //cout<<cal(0,1)<<endl;
    for(int i=;i<=n;i++) {
        int l = , r = i-,A=;
        while(l<=r) {
            int mid = (l+r) >> ;
            if(cal(mid,i-)> a[i].p) l = mid+,A=mid;
            else r = mid-;
        }
        lefts[i] = a[A];
       // cout<<A<<" ";
        l = i+, r = n+;A = n+;
        while(l<=r) {
            int mid = (l+r) >> ;
            if(cal(i+,mid)> a[i].p) r=mid-,A = mid;
            else l = mid+;
        }
        rights[i] = a[A];
    //    cout<<A<<endl;
    }

    for(int i=;i<=n;i++) {
        if(abs(lefts[i].x-a[i].x)==abs(rights[i].x-a[i].x)) {
            if(lefts[i].p>rights[i].p) ans[a[i].id] = lefts[i].id;
            else ans[a[i].id] = rights[i].id;
        }
        else if(abs(lefts[i].x-a[i].x)<abs(rights[i].x-a[i].x)) {
           ans[a[i].id] = lefts[i].id;
        }
        else ans[a[i].id] = rights[i].id;
    }
    for(int i=;i<=n;i++) printf("%d ",ans[i]);
    printf("\n");

}

RMQ+二分