[HNOI2008]水平可见直线

最新推荐文章于 2020-01-31 12:59:20 发布

Cyhlnj

最新推荐文章于 2020-01-31 12:59:20 发布

阅读量346

点赞数

分类专栏：半平面交单调队列/栈

本文链接：https://blog.csdn.net/oi_Konnyaku/article/details/78975913

版权

单调队列/栈同时被 2 个专栏收录

14 篇文章 0 订阅

订阅专栏

半平面交

1 篇文章 0 订阅

订阅专栏

按斜率排序后画个图，用单调栈维护这个半平面交

# include <bits/stdc++.h>
# define IL inline
# define RG register
# define Fill(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long ll;
const int _(50010), INF(2147483647);

IL ll Read(){
    RG char c = getchar(); RG ll x = 0, z = 1;
    for(; c < '0' || c > '9'; c = getchar()) z = c == '-' ? -1 : 1;
    for(; c >= '0' && c <= '9'; c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
    return x * z;
}

int n, a[_], b[_], id[_], s[_], top;

IL bool Cmp(RG int x, RG int y){  return a[x] != a[y] ? a[x] < a[y] : b[x] < b[y];  }

IL double Cross(RG int x, RG int y){  return 1.0 * (b[y] - b[x]) / (1.0 * (a[x] - a[y]));  }

int main(RG int argc, RG char* argv[]){
    n = Read();
    for(RG int i = 1; i <= n; ++i) a[i] = Read(), b[i] = Read(), id[i] = i;
    sort(id + 1, id + n + 1, Cmp);
    for(RG int i = 1; i <= n; ++i){
        while(top && a[id[i]] == a[s[top]]) --top;
        while(top > 1 && Cross(s[top - 1], s[top]) >= Cross(s[top - 1], id[i])) --top;
        s[++top] = id[i];
    }
    sort(s + 1, s + top + 1);
    for(RG int i = 1; i <= top; ++i) printf("%d ", s[i]);
    return 0;
}