摘要:
求相交的公路,对N排序,然后对M求逆序对,不过要求有相交的,必然要求在次城市后面,所以int sumge = i - (qur(s[tmp].y)) - ge;,这里修改了老多次,不过还好1Y了。3067#define lowbit(x) x & -xstruct sta{ int x,y;};sta s[MAXN];int n,m,k,maxx;int num[1005];int cmp(const void *a,const void *b){ struct sta *c = (sta *)a; struct sta *d = (sta *)b; if(c->x == d-& 阅读全文
posted @ 2011-07-21 16:50 MDeath-Kid 阅读(146) 评论(0) 推荐(0) 编辑