Submission #132983

---

Source Code Expand

import java.util.Scanner;

public class Main {

    /**
     * @param args
     */
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int R = sc.nextInt();
        int G = sc.nextInt();
        int B = sc.nextInt();
        int total = R + G + B;
        
        int min = Integer.MAX_VALUE;
        String key = "";
        for (int r = -500; r<0; r++) {
            for (int g=r+R; g<150; g++) {
                for (int b=g+G; b<200; b++) {
                    int tmp = count(r, r+R-1, g, g+G-1, b, b+B-1);
                    if (tmp < min) {
                        min = tmp;
                        key = r + ":" + (r+R-1) + " " + g + ":" + (g+G-1) + " " + b + ":" + (b+B-1);
                    }
                }
            }
        }

        System.out.println(min);
//        System.out.println(key);
    }

    private static int count(int rl, int rr, int gl, int gr, int bl, int br) {
        int step = 0;

        step += countBase(rl, rr, -100);
        step += countBase(gl, gr, 0);
        step += countBase(bl, br, 100);

        return step;
    }

    private static int countBase(int left, int right, int base) {
        int count = 0;
        int length = right - left + 1;

        if (base < left) {
            count += length * (left - base);
            count += length * (length + 1) / 2;
        } else if (right < base) {
            count += length * (base-right);
            count += length * (length + 1) / 2;
        } else {
            int rLen = right - base;
            int lLen = base - left;
            count += rLen * (rLen + 1) / 2;
            count += lLen * (lLen + 1) / 2;
        }

        return count;
    }
}

Submission Info

Judge Result