3月21日笔记

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileReader;
import java.io.IOException;
import java.util.Scanner;


public class Main {
	
	public static int max(int a,int b) {
		return a>b?a:b;
	}
	
	public static void TurnToEnd() {
		System.out.println("ERROR!!!");
		System.exit(0);
	}
	public static void main(String[] args) throws IOException {
		int[] a=new int[10010];
		int[] res=new int[10010];
		int n;
		BufferedReader br= new BufferedReader(new FileReader("src\\my0311\\myFile.txt"));
		String[] s=br.readLine().split(",");
		n=Integer.parseInt(s[0]);
		
		
		s=br.readLine().split(",");
		if(s.length!=n) {
			TurnToEnd();
		}
		for(int i=1;i<=n;i++) {
			if(s[i-1].length()<9) {
				a[i]=Integer.parseInt(s[i-1]);
			}else {
				TurnToEnd();
			}
		}
		int k=a[0];
		for(int i=1;i<=n;i++) {
			if(res[i-1]<0) res[i]=a[i];
			else res[i]=a[i]+res[i-1];
			if(res[i]>1e9||res[i]<-1e9) {
				TurnToEnd();
			}
			k=max(k,res[i]);
		}
		
		System.out.println(k);
		
	}
}

6,
5,6,-3,8,-9,60000000000

---

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileReader;
import java.io.IOException;
import java.util.Scanner;


public class Main3 {
	
	public static int max(int a,int b) {
		return a>b?a:b;
	}
	
	public static void TurnToEnd() {
		System.out.println("ERROR!!!");
		System.exit(0);
	}
	
	public static void main(String[] args) throws IOException {
		int[][] a=new int[1010][1010],sum=new int[1010][1010];
		int n,m;
		BufferedReader br= new BufferedReader(new FileReader("src\\my0311\\myFile3.txt"));
		String[] s=br.readLine().split(",");
		n=Integer.parseInt(s[0]);
		s=br.readLine().split(",");
		m=Integer.parseInt(s[0]);
		
		for(int i=1;i<=n;i++) {
			s=br.readLine().split(",");
			if(s.length!=m) {
				TurnToEnd();
			}
			for(int j=1;j<=m;j++) {
				if(s[j-1].length()<9) {
					a[i][j]=Integer.parseInt(s[j-1]);
				}else {
					TurnToEnd();
				}
			}
		}
		
		for(int i=1;i<=n;i++) {
			for(int j=1;j<=m;j++) {
				sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]+a[i][j];
				if(sum[i][j]>1e9||sum[i][j]<-1e9) {
					TurnToEnd();
				}
			}
		}
		
		int k=a[0][0];
		for(int i=1;i<=n;i++) {
			for(int j=1;j<=m;j++) {
				for(int u=i;u<=n;u++) {
					for(int v=j;v<=m;v++) {
						k=max(k,sum[u][v]-sum[i-1][v]-sum[u][j-1]+sum[i-1][j-1]);
						if(k>1e9||k<-1e9) {
							TurnToEnd();
						}
					}
				}
			}
		}
		System.out.println(k);
		
	}
}

3,
6,
5,6,-3,8,-9,2
1,-12,20,0,-3,-5
-9,-7,-3,6,7,-1