CCF计算机软件能力认证201609前两题java满分解

第一题

package ccf201609;

import java.util.Scanner;

public class p1 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }
        int max = 0;
        for (int i = 1; i < n; i++) {
            int abs = Math.abs(a[i] - a[i - 1]);
            if (max < abs) {
                max = abs;
            }
        }
        System.out.println(max);
    }
}

第二题

package ccf201609;

import java.util.Scanner;

public class p2 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] p = new int[n];
        for (int i = 0; i < n; i++) {
            p[i] = sc.nextInt();
        }
        int[][][] seat = new int[20][6][2];
        int count = 1;
        for (int i = 0; i < 20; i++) {
            for (int j = 0; j < 5; j++) {
                seat[i][j][0] = count;
                seat[i][j][1] = 1;
                count++;
            }
            seat[i][5][0] = 5;
        }
        int sum = 0;
        for (int i = 0; i < n; i++) {
            if (100 - sum > p[i]) {
                for (int j = 0; j < 20; j++) {
                    if (p[i] <= seat[j][5][0]) {
                        sum += p[i];
                        int k = 5 - seat[j][5][0];
                        do {
                            seat[j][k][1] = 0;
                            System.out.print(seat[j][k][0] + " ");
                            seat[j][5][0]--;
                            k++;
                            p[i]--;
                        } while (p[i] > 0);
                        break;
                    }
                }
                System.out.println();
            } else {
                int all = 0;
                for (int j = 0; j < 20; j++) {
                    if (all == p[i]) break;
                    for (int k = 0; k < 5; k++) {
                        if (all == p[i]) break;
                        if (seat[j][k][1] == 1) {
                            System.out.print(seat[j][k][0]+" ");
                            all++;
                        }
                    }
                }
                System.out.println();
            }
        }

    }
}