這道題做了幾遍

感覺這次做得比較好的就是做好了每個函式的封裝

無非使用了二維陣列的排序  就變成了很簡單的一道題  

package csp2017_09_2;

import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class Main {
	static int res[];
		
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int k = sc.nextInt();
		int a[][] = new int[k][3];
		for (int i = 0; i < a.length; i++) {
			a[i][0] = sc.nextInt();
			a[i][1] = sc.nextInt();
			a[i][2] = sc.nextInt()+a[i][1];
		}
		int as[][] = a.clone();
		int ae[][] = a.clone();
		Sort(as,1);
		Sort(ae,2);
		
		res = new int[n+1];
		for (int i = 0; i < res.length; i++) {
			res[i] = i;
		}
		
		int t = 0;
		int s = 0,e = 0;
		while((t++)<10101){
			
			for (; e < ae.length; e++) {
				if(t<ae[e][2]) break;
				if(t==ae[e][2]){
					PBack(ae[e][0]);
				}
			}
			for (; s < as.length; s++) {
				if(t<as[s][1]) break;
				if(t==as[s][1]){
					Use(as[s][0]);
				}
			}
			
			
			if(s==as.length&&e==ae.length) break;
		}
		ShowAns();
	}

	private static void PBack(int name) {
		for (int i = 0; i < res.length; i++) {
			if(res[i] == -1){
				res[i] = name;
				break;
			}
		}
	}

	private static void Use(int name) {
		for (int i = 0; i < res.length; i++) {
			if(res[i] == name){
				res[i] = -1;
				break;
			}
		}
	}

	private static void Sort(int[][] a,int i) {
		Arrays.sort(a,new Comparator<int[]>(){
			public int compare(int[] o1, int[] o2) {
				if(o1[i]==o2[i]) return o1[0]-o2[0];
				return o1[i]-o2[i] ;
			}
		});
	}

	public static void ShowAns(){
		for (int i = 1; i < res.length; i++) {
			System.out.print(res[i]+" ");
		}
		System.out.println();
	}
	
}
 

----------------------+——————————————————————————————————————

第一遍寫：

package csp2017_09_2;

import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class Main_Old{
	
	public static void main(String args[]){
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int k = sc.nextInt();
		int a[][] = new int[k][3];
		for (int i = 0; i < a.length; i++) {
			a[i][0] = sc.nextInt();
			a[i][1] = sc.nextInt();
			a[i][2] = sc.nextInt()+a[i][1];
		}
		int ans[] = new int[n];
		for (int i = 0; i < ans.length; i++) {
			ans[i] = i+1;
		}
		
		int as[][]=a.clone(),ae[][]=a.clone();
		Arrays.sort(as,new Comparator<int[]>() {
			public int compare(int[] o1, int[] o2) {
				if(o1[1]==o2[1]) return o1[0]-o2[0];
				else return o1[1]-o2[1];
			}
		});
		Arrays.sort(ae,new Comparator<int[]>() {
			public int compare(int[] o1, int[] o2) {
				if(o1[2]==o2[2]) return o1[0]-o2[0];
				else return o1[2]-o2[2];
			}
		});
		int t = 0;
		int s=0,e=0;
		while(t<10101){
			for (; e < k; e++) {
				if(ae[e][2]>t) break;
				if(ae[e][2]==t){
					int v = ae[e][0];
					for (int i = 0; i < ans.length; i++) {
						if(ans[i]==-1){
							ans[i] = v;
							break;
						}
					}
				}
			}
			for (; s < k; s++) {
				if(as[s][1]>t) break;
				if(as[s][1]==t){
					int v = as[s][0];
					for (int i = 0; i < ans.length; i++) {
						if(v==ans[i]) {
							ans[i] = -1;
							break;
						}
					}
				}
				
			}
			t++;
			if(s==k&&e==k) break;
		}
		for (int i = 0; i < ans.length; i++) {
			System.out.print(ans[i]+" ");
		}
	}
}