07年B题最优公交线路问题(16)

else if (a[i] == 'D') {

k = 1; city[j].stop[0, h - 1 - scan];

city[j].stop[0, scan];

} case 1: {

h = 0; flag = 0; }

else if (a[i] == 'L') {

if (k == 0) {

if (city[j].direct == 'S')

for (int scan = 0; scan < h; scan++) {

city[j].stop[1, scan] = } else

for (int scan = 0; scan < h; scan++) {

city[j].stop[0, scan + h] = } } j++;

city[j].stop = new int[2, 170]; flag = 1; }

break; if (a[i] == 'M') {

city[j].price = 'M'; flag = 2; }

else if (a[i] == 'F') {

47

city[j].price = 'F'; flag = 2; }

break; } case 2: {

if (a[i] == 'U') {

city[j].direct = 'U'; k = 0; h = 0; flag = 0; }

else if (a[i] == 'C') {

city[j].direct = 'C'; k = 0; h = 0; flag = 0; }

else if (a[i] == 'S') {

city[j].direct = 'S'; k = 0; h = 0;

city[j].stop[k, Convert.ToInt32(a.Substring(i + 1, 4));

h++; flag = 0; }

break; } } }

for (int x = 0; x < 3958; x++) for (int y = 0; y < 3958; y++) dis[x, y] = 99;

for (int j = 1; j <= 520; j++) {

for (int x = 0; city[j].stop[0, x] > 0; x++)

48

h] =

for (int y = x; city[j].stop[0, y] > 0; y++) {

if (city[j].price == 'M') {

dis[city[j].stop[0, x], city[j].stop[0, y]] = 1; }

else if (city[j].price == 'F') {

2;

3;

2;

if (y - x <= 20)

dis[city[j].stop[0, x], city[j].stop[0, y]] = 1; else if (y - x > 20 && y - x <= 40) {

if (dis[city[j].stop[0, x], city[j].stop[0, y]] > 2) dis[city[j].stop[0, x], city[j].stop[0, y]] = } else {

if (dis[city[j].stop[0, x], city[j].stop[0, y]] > 3) dis[city[j].stop[0, x], city[j].stop[0, y]] = } } }

for (int x = 0; city[j].stop[1, x] > 0; x++) for (int y = x; city[j].stop[1, y] > 0; y++) {

if (city[j].price == 'M') {

dis[city[j].stop[1, x], city[j].stop[1, y]] = 1; }

else if (city[j].price == 'F') {

if (y - x <= 20)

dis[city[j].stop[1, x], city[j].stop[1, y]] = 1; else if (y - x > 20 && y - x <= 40) {

if (dis[city[j].stop[1, x], city[j].stop[1, y]] > 2) dis[city[j].stop[1, x], city[j].stop[1, y]] = } else {

49

if (dis[city[j].stop[1, x], city[j].stop[1, y]] > 3) dis[city[j].stop[1, x], city[j].stop[1, y]] = 3;

} } } }

for (int x = 0; x < 3958; x++) for (int y = 0; y < 3958; y++) rec[x, y] = 0;

for (int x = 1; x < 3958; x++) …… 此处隐藏：226字，全部文档内容请下载后查看。喜欢就下载吧 ……