-
Notifications
You must be signed in to change notification settings - Fork 0
/
Program.cs
165 lines (145 loc) · 6.49 KB
/
Program.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
using System;
using System.Collections;
using System.Collections.Generic;
using System.IO;
namespace malasiya_surfing
{
class Program
{
static void Main(string[] args)
{
FileStream surf = new FileStream("./map.txt", FileMode.Open);
StreamReader sr = new StreamReader(surf);
string line = sr.ReadLine();
string[] size = line.Split(' ');
int width = int.Parse(size[0]);
int height = int.Parse(size[1]);
int maxLength = 0;
int maxDepth = 0;
int[,] board = new int[width, height];
Block[,] solution = new Block[width, height];
Tuple<int, int> curSol;
Stack<Tuple<int, int>> longest = new Stack<Tuple<int, int>>();
//Initialize the solution array
for (int y = 0; y < height; y++)
{
for (int x = 0; x < width; x++)
{
solution[x, y] = new Block();
}
}
//Read the file and populate the board
for (int y = 0; y < height; y++)
{
line = sr.ReadLine();
string[] row = line.Split(' ');
for (int x = 0; x < width; x++)
{
board[x, y] = int.Parse(row[x]);
}
}
Console.WriteLine("Read the file");
//Initialize the solution array with the locations of the next piece of each block.
for (int y = 0; y < height; y++)
{
for (int x = 0; x < width; x++)
{
//Check Left
if (x > 0 && board[x, y] > board[x - 1, y])
solution[x, y].Left = true;
//Check Up
if (y > 0 && board[x, y] > board[x, y - 1])
solution[x, y].Up = true;
//Check Right
if (x < width - 1 && board[x, y] > board[x + 1, y])
solution[x, y].Right = true;
//Check Down
if (y < height - 1 && board[x, y] > board[x, y + 1])
solution[x, y].Down = true;
}
}
Console.WriteLine("Initialized maze");
//Find the longest length of each block
for (int y = 0; y < height; y++)
{
for (int x = 0; x < width; x++)
{
curSol = SearchAlgo.itsPersonal(ref solution, ref board, new Tuple<int, int>(x, y), 1, 0, width, height);
solution[x, y].maxLength = curSol.Item1;
solution[x, y].maxDepth = curSol.Item2;
if (maxLength <= curSol.Item1)
{
if (maxLength == curSol.Item1)
{
if (maxDepth < curSol.Item2)
{
maxDepth = curSol.Item2;
}
}
else
{
maxLength = curSol.Item1;
maxDepth = curSol.Item2;
}
}
}
}
Console.WriteLine("Max length");
Console.WriteLine(maxLength);
Console.WriteLine("Max depth");
Console.WriteLine(maxDepth);
Console.WriteLine("Woof");
Console.ReadLine();
}
class SearchAlgo
{
public static Tuple<int,int> itsPersonal(ref Block[,] sol, ref int[,] board, Tuple<int, int> curPos, int curLength, int curDepth, int width, int height)
{
Tuple<int, int> curFinding = new Tuple<int,int>(curLength, curDepth);
Tuple<int, int>[] lengths = new Tuple<int, int>[4];
//Check Left
if (sol[curPos.Item1, curPos.Item2].Left)
{
curFinding = itsPersonal(ref sol, ref board, new Tuple<int, int>(curPos.Item1 - 1, curPos.Item2), curLength + 1, curDepth + board[curPos.Item1,curPos.Item2] - board[curPos.Item1 - 1, curPos.Item2], width, height);
lengths[0] = new Tuple<int,int>(curFinding.Item1, curFinding.Item2);
}
//Check Up
if (sol[curPos.Item1, curPos.Item2].Up)
{
curFinding = itsPersonal(ref sol, ref board, new Tuple<int, int>(curPos.Item1, curPos.Item2 - 1), curLength + 1, curDepth + board[curPos.Item1,curPos.Item2] - board[curPos.Item1, curPos.Item2 - 1], width, height);
lengths[1] = new Tuple<int, int>(curFinding.Item1, curFinding.Item2);
}
//Check Right
if (sol[curPos.Item1, curPos.Item2].Right)
{
curFinding = itsPersonal(ref sol, ref board, new Tuple<int, int>(curPos.Item1 + 1, curPos.Item2), curLength + 1, curDepth + board[curPos.Item1,curPos.Item2] - board[curPos.Item1 + 1, curPos.Item2], width, height);
lengths[2] = new Tuple<int, int>(curFinding.Item1, curFinding.Item2);
}
//Check Down
if (sol[curPos.Item1, curPos.Item2].Down)
{
curFinding = itsPersonal(ref sol, ref board, new Tuple<int, int>(curPos.Item1, curPos.Item2 + 1), curLength + 1, curDepth + board[curPos.Item1,curPos.Item2] - board[curPos.Item1, curPos.Item2 + 1], width, height);
lengths[3] = new Tuple<int, int>(curFinding.Item1, curFinding.Item2);
}
foreach (Tuple<int, int> value in lengths)
{
if (value != null && value.Item1 >= curFinding.Item1)
{
if (value.Item1 == curFinding.Item1)
{
if (value.Item2 >= curFinding.Item2)
{
curFinding = new Tuple<int, int>(value.Item1, value.Item2);
}
}
else
{
curFinding = new Tuple<int, int>(value.Item1, value.Item2);
}
}
}
return new Tuple<int,int>(curFinding.Item1, curFinding.Item2);
}
}
}
}