输入输出样例

样例1

输入

  1. 4
  2. 4 74 -7 -12 -5
  3. 5 73 -8 -6 59 -4
  4. 5 76 -5 -10 60 -2
  5. 5 80 -6 -15 59 0

输出

  1. 222 1 0

样例2

输入

  1. 5
  2. 4 10 0 9 0
  3. 4 10 -2 7 0
  4. 2 10 0
  5. 4 10 -3 5 0
  6. 4 10 -1 8 0

输出

  1. 39 4 2

题解一

运行错误。80分。
模拟，不知道错在哪里。

  1. import java.io.BufferedReader;
  2. import java.io.IOException;
  3. import java.io.InputStreamReader;
  4. import java.util.ArrayList;
  5. import java.util.List;
  7. public class Main {
  8.     public static void main(String[] args) throws IOException {
  9.         BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
  11.         int n = Integer.parseInt(reader.readLine().trim());
  13.         long T = 0;
  14.         String[] strs;
  15.         // 下落果树下标数组
  16.         List<Integer> list = new ArrayList<>(n);
  17.         // 是否发生下落
  18.         boolean flag;
  19.         long total, num;
  20.         for (int i = 1, m; i <= n; ++i) {
  21.             strs = reader.readLine().trim().split(" ");
  22.             m = Integer.parseInt(strs[0]);
  23.             total = Integer.parseInt(strs[1]);
  24.             flag = false;
  25.             for (int j = 2; j <= m; ++j) {
  26.                 num = Integer.parseInt(strs[j]);
  27.                 if (num > 0) {
  28.                     if (num < total) {
  29.                         total = num;
  30.                         flag = true;
  31.                     }
  32.                 } else {
  33.                     total += num;
  34.                 }
  35.             }
  36.             T += total;
  37.             if (flag) {
  38.                 list.add(i);
  39.             }
  40.         }
  42.         int D = list.size();
  43.         int E = 0;
  44.         if ((list.get(D - 1) == n) && (list.get(0) == 1) && (list.get(1) == 2)) {
  45.             ++E;
  46.         }
  47.         if ((list.get(D - 1) == n) && (list.get(0) == 1) && (list.get(D - 2) == n - 1)) {
  48.             ++E;
  49.         }
  50.         for (int i = 1; i < D - 1; ++i) {
  51.             if ((list.get(i - 1) == list.get(i) - 1) && (list.get(i + 1) == list.get(i) + 1)) {
  52.                 ++E;
  53.             }
  54.         }
  55.         System.out.println(T + " " + D + " " + E);
  56.     }
  57. }