You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
209 lines
6.7 KiB
209 lines
6.7 KiB
using System; |
|
using System.Collections.Generic; |
|
using System.IO; |
|
using static System.Console; |
|
|
|
namespace komvo |
|
{ |
|
class Program |
|
{ |
|
public static List<Point> Points = new List<Point>(); |
|
|
|
static void Main(string[] args) |
|
{ |
|
string file = "coord.txt"; |
|
|
|
using (StreamReader cr = new StreamReader(file)) |
|
{ |
|
string line; |
|
while ((line = cr.ReadLine()) != null) |
|
{ |
|
string[] str = line.Split(); |
|
Points.Add(new Point { X = int.Parse(str[0]), Y = int.Parse(str[1]) }); |
|
WriteLine(str[0] + " " + str[1]); |
|
} |
|
} |
|
WriteLine(); |
|
|
|
int matr = Points.Count; |
|
double[,] Matrix = new double[matr, matr]; |
|
|
|
for (int i = 0; i < Points.Count; i++) |
|
{ |
|
for (int j = i; j < Points.Count - 1; j++) |
|
{ |
|
Matrix[i, j + 1] = Matrix[j + 1, i] = |
|
Math.Sqrt(Math.Pow(Points[j + 1].X - Points[i].X, 2) + Math.Pow(Points[j + 1].Y - Points[i].Y, 2)); |
|
} |
|
} |
|
|
|
for (int i = 0; i < matr; i++) |
|
{ |
|
for (int j = 0; j < matr; j++) Write("{0:00.00} ", Matrix[i, j]); |
|
WriteLine(); |
|
} |
|
|
|
string formP = string.Empty; |
|
for (int i = 2; i <= Points.Count; i++) formP += i.ToString(); |
|
|
|
int fct = Fact(Points.Count - 1); |
|
WriteLine("{0} {1}", formP, fct); |
|
WriteLine("\n\n"); |
|
|
|
int[] routes = new int[fct]; |
|
double[] leng = new double[fct]; |
|
|
|
int waves = fct / 6; |
|
|
|
int cn = 1, cn2 = 0; |
|
string inf = formP; |
|
for (int i = 1; i < waves + 1; i++) |
|
{ |
|
for(int j = 0; j < 6; j++) |
|
{ |
|
if (i == 0 && j == 0) { routes[j + (i - 1) * 6] = int.Parse(formP); WriteLine(routes[j + (i - 1) * 6]); } |
|
else if (j % 2 == 0) { routes[j + (i - 1) * 6] = int.Parse(formP = Swap(formP, 0, j / 2)); WriteLine(routes[j + (i - 1) * 6]); } |
|
else { routes[j + (i - 1) * 6] = int.Parse(Swap(formP, 1, 2)); WriteLine(routes[j + (i - 1) * 6]); } |
|
} |
|
|
|
|
|
if (waves > 1) |
|
{ |
|
|
|
|
|
|
|
if (i % 4 == 0 && waves > 4) |
|
{ |
|
formP = Swap(formP, cn2++, 4); |
|
WriteLine("{0} {1}", formP, inf); |
|
} |
|
else |
|
{ |
|
switch (cn) |
|
{ |
|
case 1: |
|
formP = Swap(formP, '2', '5'); |
|
cn++; |
|
break; |
|
case 2: |
|
formP = Swap(formP, '3', '2'); |
|
cn++; |
|
break; |
|
case 3: |
|
formP = Swap(formP, '4', '3'); |
|
cn++; |
|
break; |
|
default: |
|
WriteLine("???????"); |
|
break; |
|
} |
|
if (cn > 3) cn = 1; |
|
//formP = Swap(inf, cn++, 3); |
|
//WriteLine("{0} {1}", formP, inf); |
|
} |
|
|
|
|
|
//if (cn > 4) |
|
//{ |
|
// cn = 0; |
|
// formP = Swap(inf, cn2, 4); |
|
// cn2++; |
|
//} |
|
//else |
|
//{ |
|
//formP = Swap(inf, cn, 3); |
|
//} |
|
//cn++; |
|
} |
|
} |
|
|
|
CountLen(ref leng, Matrix, routes); |
|
|
|
double optim = leng[0]; |
|
int oIndex = 0; |
|
for (int i = 0; i < leng.Length; i++) |
|
{ |
|
WriteLine("{0:N2} - {1}", leng[i], routes[i]); |
|
if (optim > leng[i]) |
|
{ |
|
optim = leng[i]; |
|
oIndex = i; |
|
} |
|
} |
|
|
|
|
|
for (int i = 0; i < routes.Length; i++) |
|
{ |
|
for (int j = i + 1; j < routes.Length - 1; j++) |
|
if (routes[i].Equals(routes[j])) WriteLine("{0} {2}:: {1} {3}!!!!", routes[i], routes[j], i, j); |
|
} |
|
WriteLine("\n\n1{1}1 - оптимальный маршрут длинной {0:00.00}\nВсего маршрутов {2}\n{4} {3}", |
|
optim, routes[oIndex], routes.Length, fct, Points.Count); |
|
|
|
|
|
|
|
|
|
|
|
//WriteLine(Fact(5)); |
|
//MessageBox.Show(Math.Sqrt(-1).ToString()); |
|
ReadKey(); |
|
|
|
} |
|
|
|
public static string Swap(string value, int first, int second) |
|
{ |
|
char[] res = value.ToCharArray(); |
|
res[first] = value[second]; |
|
res[second] = value[first]; |
|
value = new string(res); |
|
|
|
return value; |
|
} |
|
|
|
public static string Swap(string value, char first, char second) |
|
{ |
|
int f, s; |
|
char[] res = value.ToCharArray(); |
|
WriteLine(f = value.IndexOf(first)); |
|
WriteLine(s = value.IndexOf(second)); |
|
res[value.IndexOf(first)] = value[value.IndexOf(second)]; |
|
res[value.IndexOf(second)] = value[value.IndexOf(first)]; |
|
value = new string(res); |
|
|
|
return value; |
|
} |
|
|
|
|
|
public static void CountLen (ref double[] result, double[,] mtr, int[] rts) |
|
{ |
|
for (int i = 0; i < rts.Length; i++) |
|
{ |
|
double res = 0; |
|
char[] ch = rts[i].ToString().ToCharArray(); |
|
for (int j = 0; j < ch.Length; j++) |
|
{ |
|
if (j == 0) res += mtr[0, int.Parse(ch[j].ToString()) - 1]; |
|
else if (j == ch.Length - 1) |
|
{ |
|
res += mtr[int.Parse(ch[j - 1].ToString()) - 1, int.Parse(ch[j].ToString()) - 1]; |
|
res += mtr[0, int.Parse(ch[j].ToString()) - 1]; |
|
} |
|
else |
|
{ |
|
res += mtr[int.Parse(ch[j - 1].ToString()) - 1, int.Parse(ch[j].ToString()) - 1]; |
|
} |
|
} |
|
result[i] = res; |
|
} |
|
} |
|
|
|
public partial struct Point |
|
{ |
|
public int X { get; set; } |
|
public int Y { get; set; } |
|
} |
|
|
|
|
|
static int Fact(int a) => a <= 1 ? 1 : a * Fact(a - 1); |
|
} |
|
} |