competitive_programming/EqualizeArray.java at master · Karthik-Ragunath/competitive_programming · GitHub

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
import java.io.*;
import java.util.*;
import java.math.*;
import java.text.*;

class EqualizeArray
{
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);
        int testcases = in.nextInt();
        for(int i = 0; i < testcases; i++)
        {
            int rows = in.nextInt();
            int columns = in.nextInt();
            int[][] inputArray = new int[rows][columns];
            ArrayList<Integer> maxValuePositions = new ArrayList<Integer>();
            int maximum = 0;
            for(int j = 0; j < rows; j++)
            {
                for(int k = 0; k < columns; k++)
                {
                    inputArray[j][k] = in.nextInt();
                    if(j == 0 && k == 0)
                    {
                        maximum = inputArray[j][k];
                        int maxPosition = j * columns + k;
                        maxValuePositions.add(maxPosition);
                    }
                    else
                    {
                        if(inputArray[j][k] > maximum)
                        {
                            maximum = inputArray[j][k];
                            maxValuePositions.clear();
                            int maxPosition = j * columns + k;
                            maxValuePositions.add(maxPosition);
                        }
                        else if(inputArray[j][k] == maximum)
                        {
                            int maximumPosition = j * columns + k;
                            maxValuePositions.add(maximumPosition);
                        }
                    }
                }
            }
            Integer[] maxValuePositionsArray = maxValuePositions.toArray(new Integer[maxValuePositions.size()]);
            int minimumDifference = 0;
            boolean flagship = false;
            for(int j = 0; j < rows; j++)
            {
                for(int k = 0; k < columns; k++)
                {
                    if(inputArray[j][k] != maximum)
                    {
                        for(int l = 0; l < maxValuePositions.size(); l++)
                        {
                            int rowPosition = ((int)(maxValuePositionsArray[l]) / columns);
                            int columnPosition = ((int)(maxValuePositionsArray[l]) % columns);
                            int rowDifference = Math.abs(rowPosition - j);
                            int columnDifference = Math.abs(columnPosition - k);
                            int difference = Math.max(rowDifference, columnDifference);
                            if(flagship == false)
                            {
                                minimumDifference = difference;
                            }
                            else if(difference < minimumDifference)
                            {
                                minimumDifference = difference;
                            }
                        }
                    }
                }
            }
            System.out.println(minimumDifference);
        }
    }
}