ZOJ 2710 Two Pipelines(二)

2014-11-24 09:38:56 · 作者: · 浏览: 1
--; guanzhi[1^t]++; city[pos].belong=1^t; pos++; } } else if(guanzhi[0] C) { int t=city[pos].belong; if(t==0) { pos++; continue; } guanzhi[t]--; guanzhi[1^t]++; city[pos].belong=1^t; pos++; } } } sort(city,city+N,cmp2); for(int i=0;i