-
Notifications
You must be signed in to change notification settings - Fork 0
/
108 - Maximum Sum.java
68 lines (62 loc) · 2.03 KB
/
108 - Maximum Sum.java
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
package com.company.Main;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException{
// write your code here
Scanner in = new Scanner(new InputStreamReader(System.in));
while (in.hasNextInt())
{
int n= in.nextInt();
for (int i =0; i<n;i++)
{
for (int j=0; j<n;j++)
{
grid[i][j] = in.nextInt();
}
}
System.out.println(TwoDsum(n));
}
}
static int [] [] grid = new int[100][100];
public static int TwoDsum(int n)
{
int [] collectionOfKadene = new int[n];
int globalMax = Integer.MIN_VALUE;
for (int leftPointer=0;leftPointer<n;leftPointer++)
{
for (int rightPointer =leftPointer; rightPointer<n;rightPointer++) {
for (int j = 0; j < n; j++) {
if (leftPointer == rightPointer)
collectionOfKadene[j] = grid[j][leftPointer];
else
collectionOfKadene[j] = maxSubArray(grid[j], leftPointer, rightPointer);
}
//System.out.println(Arrays.toString(collectionOfKadene));
globalMax = Math.max(maxSubArray(collectionOfKadene),globalMax);
}
}
return globalMax;
}
public static int maxSubArray(int [] value,int leftPointer,int rightPointer)
{
int max =0;
for (int i=leftPointer;i<=rightPointer;i++)
max+=value[i];
return max;
}
public static int maxSubArray(int [] value)
{
int maxSoFar =value[0];
int maxEndingHere = value[0];
for (int i=1;i<value.length;i++)
{
maxEndingHere = Math.max(maxEndingHere+value[i],value[i]);
maxSoFar = Math.max(maxSoFar,maxEndingHere);
}
return maxSoFar;
}
}