E9 90 167 400 123 164 E10 123 177.5 E10 123 177.5 E11 143 153 E11 143 153 E12 192 264 E12 192 264 E13 145 285 E13 145 285 E14 133 255 E14 133 255 E15 90 198 422 284 173 F1 382.5 267 F1 382.5 267 F2 373 250 F2 373 250 F3 330 219 579 462 447 F4 400 247 F4 400 247 F5 441 442 F5 441 442 F6 417 312 572 472 340 F7 332 246 F7 332 246 F8 321 275 F8 321 275 F9 403 140 F9 403 140 F10 420 269 549 348 255 F11 455 335 F11 455 335 注：其中打下划线的表示改变的交巡警服务平台。
附录（七） Lingo代码： sets:
pingtai/1..20/:police; lukou/1..13/:cross;
links(pingtai,lukou):distance,x; endsets min=y;
@for(links:(distance*x)<=y); !需求约束;
@for(lukou(j):@sum(pingtai(i):x(i,j))=cross(j)); !产量约束;
@for(pingtai(i):@sum(lukou(j):x(i,j))<=police(i)); @for(lukou(j):@for(pingtai(i):@bin(x(i,j)))); data:
police=1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1;
cross=1 1 1 1 1 1 1 1 1 1 1 1 1;
distance=22.24 16.03 9.29 19.29 21.1 22.5 22.89 19 19.52 12.08 5.88 11.85 4.89
20.46 14.13 7.39 17.39 19.2 20.6 21.12 17.23 17.74 10.31 3.98 10.31 6.04
18.35 12.77 6.03 16.03 17.84 19.24 19.01 15.12 15.63 8.2
6.09 8.2 4.39
21.89 15.01 8.27 18.27 20.08 21.48 22.55 16.15 15.46 8.03 4.86 7.32 0.35
17.48 12.97 6.23 16.23 17.61 19.01 18.14 11.31 10.62 3.18 9.42 2.48 5.18
17.51 13 6.26 16.27 17.64 19.04 18.17 11.34 10.65 3.21 9.45 2.51 5.34
14.75 10.91 4.16 14.17 14.87 16.27 15.4 8.57 8.02 0.58 7.36 1.29 7.92
14.09 9.43 2.69 12.7 14.21 15.62 14.75 10.23 10.49 3.06 5.89 3.1 8.68
13.01 8.27 1.53 11.54 13.13 14.54 13.67 9.78 10.72 3.32 4.73 4.03 9.34
7.59 12.78 6.85 9.51 7.71 9.11 8.24 14.19 15.14 7.74 10.04 8.45 14.65
3.79 8.34 11.29 5.07 3.27 4.68 3.81 18.63 19.58 12.18 14.48 12.89 19.09
0 11.95 14.43 8.69 6.88 6.48 3.59 21.78 22.73 15.33 17.63 16.04 22.24
5.98 5.97 12.71 2.71 0.91 0.5 2.39 22.81 23.76 16.36 16.12 17.06 21.33
11.95 0 6.74 3.26 5.07 6.47 8.36 17.94 18.89 11.49 10.15 12.2 15.36
17.03 13.19 6.45 16.45 17.15 18.56 17.69 4.75 5.7 4.4 9.64 5.11 11.74
14.43 6.74 0 10.01 11.81 13.21 15.09 11.2 12.15 4.75 3.41 5.46 8.62
21.78 14.9 8.16 18.17 19.97 21.38 22.44 18.49 18.75 11.32 4.76 11.36 7.82
24 18.51 11.77 21.78 23.58 24.99 24.66 20.13 20.4 12.97 8.37 13.01 6.73
22.55 16.96 10.22 20.23 22.03 23.43 23.2 19.31 19.83 12.39 7.64 12 5.03
26.7 21.21 14.47 24.48 26.28 27.69 27.35 22.83 22.25 14.81 11.07 14.11 6.45 ;
enddata
附录八
广度优先遍历算法： #include
typedef struct point {
int n_th; double x; double y; }point;
int For_dist(int x, int y); int pos[81];
struct point a[583]; int main(void) {
ifstream fin(\ ofstream fout(\ float x, y; int i, j; // Read Data
for (i = 1; i <= 582; ++i) {
fin >> x >> y; a[i].n_th = i; a[i].x = x; a[i].y = y; }
for (i = 1; i <= 80; ++i) {
fin >> pos[i]; }
for (i = 1; i <= 80; ++i) // 对全市的80个交警进行遍历 {
for(j = 1; j <=582; ++j) // find 交警坐标 {
if (a[j].n_th == pos[i]) // 如果找到了 {
if ( For_dist(32, j) <= 60 /*&& For_dist(32, j)>35 */) fout << a[j].n_th << \\\t \<< a[j].x << \\\t\<< a[j].y << endl; } } }
return 0;
}
int For_dist(int m, int n) {
double dist ;
dist = sqrt( pow(a[m].x - a[n].x, 2) + pow(a[m].y-a[n].y ,2) ); return dist; }
附录（九）
二分法最优匹配算法： #include
int a[M][M],n,ans; bool b[M];
ifstream fin(\
ofstream fout(\
void dfs(int x,int sum) {
int i; if(x==n) {
if(sum
if(sum>ans) return;
for(i=0;i if(b[i]) continue; b[i]=1;//标记该列有取 dfs(x+1,sum+a[x][i]); b[i]=0; } } int main() { int i,j; fin >> n; ans=0; for(i=0;i for(j=0;j fin >> a[i][j]; ans+=a[i][j]; } b[i]=0; } for(i=0;i for(j=0;j fout << a[i][j] << \ } fout << endl; } dfs(0,0); return 0; }