import java.util.Arrays; import java.util.Scanner; /** * 1.把所有[x, y]区间的值 + z * 2.遍历最大值位置就可以 * @author * */ public class Main { public static void main(String args[]) { Scanner cin = new Scanner(System.in); int n = cin.nextInt(); int arr[] = new int[n]; //用来存放所有数字 while (cin.hasNextInt()) { int x = cin.nextInt(); int y = cin.nextInt(); int z = cin.nextInt(); if(x == -1 && y == -1 && z == -1) { break; } for(int i = x; i <= y; i++) { arr[i] += z; //数组添加上相应的z } } System.out.println(Arrays.toString(arr)); int positionStart = 0; int positionEnd = 0; int temp = arr[0]; for(int i = 0; i < n; i++) { if(arr[i] > temp) { temp = arr[i]; positionStart = i; } if(arr[i] == temp) { temp = arr[i]; positionEnd = i; } } if(positionStart == positionEnd) { System.out.println(positionStart); } else { System.out.println(positionStart + " " + positionEnd); } } }