代码:
package com.test;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int N = input.nextInt();
int M = input.nextInt();
int[][] tree = new int[N][M+1];
int T = 0, k = 0, P = 0;
int max = 0;
int Q = 0;
for (int i=0;i<N;i++){
max = 0;
for (int j=0;j<M+1;j++){
tree[i][j] = input.nextInt();
T = T + tree[i][j];
if (j != 0){
max = max + tree[i][j];
}
if (max < Q){
Q = max;
k = i;
}
}
}
P = Math.abs(Q);
System.out.println(T+" "+(k+1)+" "+P);
}
}