ural 1146. Maximum Sum dp

1146. Maximum Sum

Time limit: 0.5 second
Memory limit: 64 MB

Given a 2-dimensional array of positive and negative integers, find the sub-rectangle with the largest sum. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the sub-rectangle with the largest sum is referred to as the  maximal sub-rectangle. A sub-rectangle is any contiguous sub-array of size 1 × 1 or greater located within the whole array.

As an example, the maximal sub-rectangle of the array:

0	−2	−7	0
9	2	−6	2
−4	1	−4	1
−1	8	0	−2

is in the lower-left-hand corner and has the sum of 15.

Input

The input consists of an  N ×  N array of integers. The input begins with a single positive integer N on a line by itself indicating the size of the square two dimensional array. This is followed by N  2 integers separated by white-space (newlines and spaces). These  N  2 integers make up the array in row-major order (i.e., all numbers on the first row, left-to-right, then all numbers on the second row, left-to-right, etc.).  N may be as large as 100. The numbers in the array will be in the range [−127, 127].

Output

The output is the sum of the maximal sub-rectangle.

Sample

input	output
4 0 -2 -7 0 9 2 -6 2 -4 1 -4 1 -1 8 0 -2	15

import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.StringTokenizer;


public class Main {
	
	public static void main(String[] args) {
		new Task().solve();
	}
}

class Task {
	InputReader in = new InputReader(System.in);
	PrintWriter out = new PrintWriter(System.out);
	
	void solve() {
		int n = in.nextInt() ;
		int[][] colSum = new int[n+1][n+1] ;
		int res = -128 ;
		Arrays.fill(colSum[0] , 0) ;
		for(int i = 1 ; i <= n ; i++){
			for(int j = 1 ; j <= n ; j++){
				int u = in.nextInt() ;
				res = Math.max(res , u) ;
				colSum[i][j] = colSum[i-1][j] + u ;
			}
		}
		
		for(int i = 0 ; i < n ; i++){
			for(int j = i+1 ; j <= n ; j++){
				int now = 0 ;
				for(int k = 1 ; k <= n ; k++){
					int u = colSum[j][k] - colSum[i][k] ;
					now += u ;
					res = Math.max(res , now) ;
					now = Math.max(now, 0) ;
				}
			}
		}		
		out.println(res) ;
		out.flush();
	}
}

class InputReader {
	public BufferedReader reader;
	public StringTokenizer tokenizer;

	public InputReader(InputStream stream) {
		reader = new BufferedReader(new InputStreamReader(stream), 32768);
		tokenizer = new StringTokenizer("");
	}

	private void eat(String s) {
		tokenizer = new StringTokenizer(s);
	}

	public String nextLine() {
		try {
			return reader.readLine();
		} catch (Exception e) {
			return null;
		} 
	}

	public boolean hasNext() {
		while (!tokenizer.hasMoreTokens()) {
			String s = nextLine();
			if (s == null)
				return false;
			eat(s);
		}
		return true;
	}

	public String next() {
		hasNext();
		return tokenizer.nextToken();
	}

	public int nextInt() {
		return Integer.parseInt(next());
	}

	public int[] nextInts(int n) {
		int[] nums = new int[n];
		for (int i = 0; i < n; i++) {
			nums[i] = nextInt();
		}
		return nums;
	}

	public long nextLong() {
		return Long.parseLong(next());
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}

	public BigInteger nextBigInteger() {
		return new BigInteger(next());
	}

}