借楼，贴T2代码。求T3通过代码 package exam360; import java.util.ArrayList; import java.util.HashMap; import java.util.HashSet; import java.util.Scanner; public class Main2 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int time = sc.nextInt(); int kind = sc.nextInt(); int[][] dp = new int[100+1][time+1]; for(int i=0;i<=kind;i++){ dp[i][0] = 0; } for(int i=1;i<=time;i++){ int kan = sc.nextInt(); for(int j=0;j<101;j++){ if(kan == j){ dp[j][i] = dp[j][i-1]+1; }else { dp[j][i] = dp[j][i-1]; } } } int Q = sc.nextInt(); for(int i=0;i<Q;i++){ int start = sc.nextInt() - 1; int end = sc.nextInt(); int sum = 0; for(int j=1;j<101;j++){ sum += (dp[j][end] > dp[j][start] ? 1 : 0); } System.out.println(sum); } } }