bzoj

#include <algorithm>
#include <cstring>
#include <cstdio>
#include <bitset>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#include <map>
#define rep(i,a,b) for(int i = a;i <= b;++ i)
#define per(i,a,b) for(int i = a;i >= b;-- i)
#define mem(a,b) memset((a),(b),sizeof((a)))
#define FIN freopen("in.txt","r",stdin)
#define FOUT freopen("out.txt","w",stdout)
#define IO ios_base::sync_with_stdio(0),cin.tie(0)
#define mid ((l+r)>>1)
#define ls (id<<1)
#define rs ((id<<1)|1)
#define N 50005
#define INF 0x3f3f3f3f
#define INFF ((1LL<<62)-1)
#define mod 998244353
typedef long long ll;
using namespace std;
  
int n,q[N],ans[N]; // q[n] = [l, r);
struct Node{
    int a,b,id;
    bool operator < (const Node &r) const {
        if(a == r.a)    return b > r.b;
        return a < r.a;
    }
}node[N];
double cal(int x, int y){
    double ans = (node[y].b-node[x].b)*1.0/(node[x].a-node[y].a);
    return ans;
}
int main()
{IO;
    //FIN;
    while(cin >> n){
        rep(i, 1, n)    { cin >> node[i].a >> node[i].b; node[i].id = i; }
        sort(node+1, node+n+1);
        int top = 0;
        rep(i, 1, n){
            if(top >= 2){
                while(top >= 2){
                    double x = cal(i, q[top-1]), X = cal(q[top-1], q[top-2]);
                    if(x <= X)   top--;
                    else
                        break;
                }
            }
            q[top++] = i;
        }
        int len = 0;
        rep(i, 0, top-1)    ans[len++] = node[q[i]].id;
        sort(ans, ans+len);
        rep(i, 0, len-1)    cout << ans[i] << " ";
    }
    return 0;
}