把已经建好的路直接合并即可; #include"stdio.h" #include"string.h" #include"stdlib.h" #include"algorithm" using namespace std; int pre[1000]; struct point { int x,y,z; }a[10000]; int cmp(point a,point b) { ret
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1102 Problem Description There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect
题目描述 You are given three integers a a a , b b b and x x x . Your task is to construct a binary string s s s of length n=a+b n = a + b n=a+b such that there are exactly a a a zeroes, exactly b b b one
题目描述 You are given three integers aa , bb and xx . Your task is to construct a binary string ss of length n = a + bn=a+b such that there are exactly aa zeroes, exactly bb ones and exactly xx indices