Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- using System.Collections.Generic;
- class SpecialValue
- {
- static void SeparateNumbers(string[] allArrs)
- {
- string[][] numbArrInArr = new string[allArrs.Length][];
- intArrInArr = new int[allArrs.Length][];
- for (int i = 0; i < allArrs.Length; i++)
- {
- numbArrInArr[i] = allArrs[i].Split(new char[] { ',' }, StringSplitOptions.RemoveEmptyEntries);
- intArrInArr[i] = new int[numbArrInArr[i].Length];
- for (int j = 0; j < numbArrInArr[i].Length; j++)
- {
- intArrInArr[i][j] = int.Parse(numbArrInArr[i][j].Trim());
- }
- }
- }
- static int[][] intArrInArr;
- static int counter = 1;
- static int sum = 0;
- class Point
- {
- public int xCoordinate { get; set; }
- public int yCoordinate { get; set; }
- public Point(int x, int y)
- {
- xCoordinate = x;
- yCoordinate = y;
- }
- }
- static int FindNumberOfCellsBFS(Point startPoint)
- {
- Queue<Point> matrixPoints = new Queue<Point>();
- matrixPoints.Enqueue(startPoint);
- while (true)
- {
- Point currentPoint = matrixPoints.Dequeue();
- if ((currentPoint.xCoordinate >= intArrInArr.Length - 1) && counter == 1)
- {
- currentPoint.xCoordinate = 0;
- }
- int lastNumber = intArrInArr[currentPoint.xCoordinate][currentPoint.yCoordinate];
- counter++;
- sum = counter + Math.Abs(lastNumber);
- if (intArrInArr[currentPoint.xCoordinate][currentPoint.yCoordinate] < 0)
- {
- //intArrInArr[currentArr][currentIndex] = int.MaxValue;
- counter = 0;
- break;
- }
- if (intArrInArr[currentPoint.xCoordinate][currentPoint.yCoordinate] == int.MaxValue)
- {
- counter = 0;
- break;
- }
- if (intArrInArr[currentPoint.xCoordinate][currentPoint.yCoordinate] >= 0)
- {
- int tempIndex = currentPoint.yCoordinate;
- //intArrInArr[currentPoint.xCoordinate][currentPoint.yCoordinate] = int.MaxValue;
- currentPoint.yCoordinate = intArrInArr[currentPoint.xCoordinate][currentPoint.yCoordinate];
- if (currentPoint.xCoordinate >= intArrInArr.Length - 1)
- {
- currentPoint.xCoordinate = -1;
- }
- matrixPoints.Enqueue(new Point(currentPoint.xCoordinate + 1, currentPoint.yCoordinate));
- }
- }
- return sum;
- }
- static void Main()
- {
- string input = Console.ReadLine(); //"6"; //
- int length = int.Parse(input);
- string[] allArrs = new string[length];
- for (int i = 0; i < allArrs.Length; i++)
- {
- allArrs[i] = Console.ReadLine();
- }
- //allArrs[0] = "6, 7, -6, 6";
- //allArrs[1] = "-4, -2, 1, 4, 4, 4, -1, 3, 1";
- //allArrs[2] = "3, -7, 2, 4, 2";
- //allArrs[3] = "-3, -3, 0, 3, 0, 1, -1, 2, 2";
- SeparateNumbers(allArrs);
- int sum = 0;
- int maxSum = 0;
- for (int j = 0; j < intArrInArr[0].Length; j++)
- {
- counter = 1;
- if (intArrInArr[0][j] < 0)
- {
- sum = counter + Math.Abs(intArrInArr[0][j]);
- }
- else if (intArrInArr[0][j] == int.MaxValue)
- {
- continue;
- }
- else if (intArrInArr[0][j] >= 0)
- {
- Point startPoint = new Point(0 + 1, intArrInArr[0][j]);
- sum = FindNumberOfCellsBFS(startPoint);
- //sum = FindNumberOfCellsBFS(0 + 1, intArrInArr[0][j]);
- }
- if (maxSum < sum)
- {
- maxSum = sum;
- }
- }
- Console.WriteLine(maxSum);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement