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

2019-08-31 09:16

FileMode.OpenOrCreate, FileAccess.Write), record9 = new FileStream(\FileMode.OpenOrCreate, FileAccess.Write);

StreamReader sr = new StreamReader(doc); StreamWriter[] sw = {new StreamWriter(abc), new StreamWriter(abc1), new StreamWriter(abc2), new StreamWriter(abc3), new StreamWriter(abc4), new StreamWriter(abc5), new StreamWriter(abc6), new StreamWriter(abc7), new StreamWriter(abc8), new StreamWriter(abc9)};

StreamWriter[] rsw = {new StreamWriter(record), new StreamWriter(record1), new StreamWriter(record2), new StreamWriter(record3), new StreamWriter(record4), new StreamWriter(record5), new StreamWriter(record6), new StreamWriter(record7), new StreamWriter(record8), new StreamWriter(record9)};

int flag = 0;

int[,] dis = new int[3958, 3958], tmp_dis = new int[3958, 3958]; int[,] rec = new int[3958, 3958]; string a = string.Empty;

string[] output = new string[10], outputs = new string[10]; line[] city = new line[521];

a = sr.ReadToEnd(); sr.Close();

for (int i = 0, j = 0, h = 0, k = 0; i < a.Length; i++) {

switch (flag) {

case 0: {

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

46

{

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

h++; }

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++) {

output[0] = string.Empty; outputs[0] = string.Empty; for (int y = 1; y < 3958; y++) {

output[0] = output[0] + dis[x, y].ToString() + \ outputs[0] = outputs[0] + rec[x, y].ToString() + \ }

sw[0].WriteLine(output[0]); rsw[0].WriteLine(outputs[0]); }

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

flag = 1;

for (int n = 1; n < 10; n++) {

if (flag == 0) {

textBox1.Text = \ return; } else

flag = 0;

for (int x = 1; x < 3958; x++) for (int y = 1; y < 3958; y++)

50


07年B题最优公交线路问题(10).doc 将本文的Word文档下载到电脑 下载失败或者文档不完整,请联系客服人员解决!

下一篇:中一二进攻战术教学设计

相关阅读
本类排行
× 注册会员免费下载(下载后可以自由复制和排版)

马上注册会员

注:下载文档有可能“只有目录或者内容不全”等情况,请下载之前注意辨别,如果您已付费且无法下载或内容有问题,请联系我们协助你处理。
微信: QQ: