Codeforces 726（div2） 首破3题分享

虽然这回感觉前三题都是思维题，但打破之前只能做2题的魔咒(第三题想复杂了)，不错

菜狗继续加油

import java.util.Scanner;

/**
 * @author: yeah
 */
public class A {
    static int t, n;

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        t = in.nextInt();
        while (t-- > 0) {
            n = in.nextInt();
            int x, sum = 0;
            for (int i = 0; i < n; i++) {
                x = in.nextInt();
                sum += x;
            }
            if (sum == n) {
                System.out.println(0);
            } else {
                if (sum > n) {
                    System.out.println(sum - n);
                } else {
                    System.out.println(1);
                }
              }

        }
    }
}

import java.util.Scanner;


/**
 * @author: yeah
 * 类似第三次周赛的A题 (曼哈顿距离)
 */
public class B {
    static int t, n, m, x, y;

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        t = in.nextInt();
        while (t-- > 0) {
            n = in.nextInt();
            m = in.nextInt();
            x = in.nextInt();
            y = in.nextInt();
            int xx = n - x >= x - 1 ? n : 1;
            int yy = m - y >= y - 1 ? m : 1;
            System.out.println(xx + " " + yy + " " + Math.abs(n + 1 - xx) + " " + Math.abs(m + 1 - yy));
        }
    }
}

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

/**
 * @author: yeah
 */
public class C {
    static int t, n;
    static int[] q;

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        t = in.nextInt();
        while (t-- > 0) {
            n = in.nextInt();
            q = new int[n];
            for (int i = 0; i < n; i++) {
                q[i] = in.nextInt();
            }
            int l = 0, r = 0, max = 1000000000;
            Arrays.sort(q);
            for (int i = 1; i < n; i++) {
                if (q[i] - q[i - 1] < max) {
                    r = i;
                    l = i - 1;
                    max = q[i] - q[i - 1];
                }
            }
            System.out.print(q[l] + " ");

            for (int i = r + 1; i < n; i++) {
                System.out.print(q[i] + " ");
            }
            for (int i = 0; i < l; i++) {
                System.out.print(q[i] + " ");
            }
            System.out.println(q[r]);
        }
    }
}