题意理解
首先考虑到,如果从一个最大的子段和如果是负数开始的,那么就可以去掉这个负数得到一个更大的子段和。于是就会想到,直接拿sum保存当前的位置的最大和。注意特判一下,如果是最后结果为0,那么表明前面全是负数/0,那么这时候再遍历一下。
代码
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static class FastScanner {
private BufferedReader br;
private StringTokenizer st;
public FastScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
public String nextToken() {
while(null == st || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (Exception e) {
}
}
return st.nextToken();
}
public int nextInt() {
return Integer.valueOf(nextToken());
}
}
static int N;
static int[] A;
static long[] sum;
public static void main(String[] args) {
FastScanner fs = new FastScanner();
N = fs.nextInt();
A = new int[N];
sum = new long[N];
long max = Long.MIN_VALUE;
A[0] = fs.nextInt();
if(A[0] > 0) {
sum[0] = A[0];
} else {
sum[0] = 0;
}
max = sum[0];
for(int i = 1; i < N; i++) {
A[i] = fs.nextInt();
long temp = sum[i - 1] + A[i];
if(temp > 0) {
sum[i] = temp;
} else {
sum[i] = 0;
}
if(sum[i] > max) {
max = sum[i];
}
}
if(max > 0) {
System.out.println(max);
} else {
max = Long.MIN_VALUE;
for(int i = 0; i < N; i++) {
max = Math.max(max, A[i]);
}
System.out.println(max);
}
}
}