sdibt 1244类似于拓扑排序

博客：http://blog.csdn.net/mypsq/article/details/39005991

#include<stdio.h>
#include<string.h>
#define N 30
struct node {
int x,y,xx,yy;
}f[N],ff[N];
int link[N],visit[N];
int main() {
     int n,m,i,j,k,cou,index,cnt;
     while(scanf("%d",&n)!=EOF) {
        for(i=1;i<=n;i++)
            scanf("%d%d%d%d",&f[i].x,&f[i].xx,&f[i].y,&f[i].yy);
        for(i=1;i<=n;i++)
            scanf("%d%d",&ff[i].x,&ff[i].y);
            memset(link,0,sizeof(link));
            memset(visit,0,sizeof(visit));
            cnt=0;
        for(i=1;i<=n;i++)
        for(j=1;j<=n;j++) {
                if(visit[j])continue;
                cou=0;
            for(k=1;k<=n;k++) {
                    if(link[k])continue;
                if(ff[j].x>=f[k].x