UVA 1382 Distant Galaxy(枚举优化)

如果四条边都枚举，那么时间复杂度O(n^5),但是只枚举上下两条线，然后根据上下两条线来算出左右两条线，时间复杂度会大大降低。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100+10;
struct node{
    int x,y;
    bool operator < (const node &rhs) const {
        return x<rhs.x;
    }
}point[maxn];
int Left[maxn],on[maxn],on2[maxn],y[maxn];
int n;
int solve()
{
    int ans=0;
    sort(y,y+n);
    sort(point,point+n);
    int m=(int)(unique(y,y+n)-y);
    if(m<=2) return n;
    for(int a=0;a<m;a++)
    {
        for(int b=a+1;b<m;b++)
        {
            int ymin=y[a],ymax=y[b];
            int k=0;
            for(int i=0;i<n;i++)
            {
                if(i==0||point[i].x!=point[i-1].x){
                    k++;
                    on[k]=on2[k]=0;
                    Left[k]=(k==0)?0:Left[k-1]+on2[k-1]-on[k-1];
                }
                if(point[i].y>ymin&&point[i].y<ymax) on[k]++;
                if(point[i].y>=ymin&&point[i].y<=ymax) on2[k]++;
            }
            if(k<=2) return n;
            int M=0;
            for(int j=1;j<=k;j++)
            {
                ans=max(ans,Left[j]+on2[j]+M);
                M=max(M,on[j]-Left[j]);
            }
        }
    }
    return ans;
}
int main()
{
    int kase=0;
    while(scanf("%d",&n)&&n)
    {
        for(int i=0;i<n;i++) {scanf("%d%d",&point[i].x,&point[i].y);y[i]=point[i].y;}
        printf("Case %d: %d\n",++kase,solve());
    }
    return 0;
}