POJ 3347 Kadj Squares (线段覆盖)

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#define INF 0x3f3f3f3f
#define MAX 100005

using namespace std;

struct node
{
    int sx,y,ex,dist;
} point[MAX];

int vis[MAX],n;

void Find(int sx,int ex,int pos)
{
    for(int i=0; i<n; i++)
    {
        if(i==pos || (point[pos].y >= point[i].y))
            continue;
        if((sx>=point[i].sx && ex<=point[i].ex) || sx>=ex)
        {
            vis[pos]=1;
            return;
        }
        else if(sx<=point[i].ex && sx>=point[i].sx)
        {
            sx=point[i].ex;
        }
        else if(ex<=point[i].ex && ex>=point[i].sx)
        {
            ex=point[i].sx;
        }
    }
}

int main()
{
    int d,sx,ex;
    int op;
    while(scanf("%d",&n),n)
    {
        op=0;
        memset(vis,0,sizeof(vis));
        for(int i=0; i<n; i++)
        {
            scanf("%d",&d);
            point[i].dist=d;
            point[i].y=d;
            point[i].sx=0;
            for(int j=0; j<i; j++)
            {
                point[i].sx=max(point[i].sx,point[j].ex-abs(point[i].dist-point[j].dist));
            }
            point[i].ex=point[i].sx+2*d;
        }
        for(int i=0; i<n; i++)
        {
            ex=point[i].ex;
            sx=point[i].sx;
            Find(sx,ex,i);
        }
        for(int i=0; i<n; i++)
        {
            if(!vis[i])
            {
                if(!op)
                {
                    op=1;
                    printf("%d",i+1);
                }
                else
                    printf(" %d",i+1);
            }
        }
        printf("\n");
    }
    return 0;
}