Face The Right Way

题目：Farmer John has arranged his N (1 ≤ N ≤ 5,000) cows in a row and many of them are facing forward, like good cows. Some of them are facing backward, though, and he needs them all to face forward to make his life perfect.
Fortunately, FJ recently bought an automatic cow turning machine. Since he purchased the discount model, it must be irrevocably preset to turn K (1 ≤ K ≤ N) cows at once, and it can only turn cows that are all standing next to each other in line. Each time the machine is used, it reverses the facing direction of a contiguous group of K cows in the line (one cannot use it on fewer than K cows, e.g., at the either end of the line of cows). Each cow remains in the same location as before, but ends up facing the opposite direction. A cow that starts out facing forward will be turned backward by the machine and vice-versa.
Because FJ must pick a single, never-changing value of K, please help him determine the minimum value of K that minimizes the number of operations required by the machine to make all the cows face forward. Also determine M, the minimum number of machine operations required to get all the cows facing forward using that value of K.

思路：首先，交换区间反转的顺序对结果是没有影响的。此外，可以知道对同一区间进行进行两次以上的反转是多余的。由此，问题就转化成了求需要被反转的区间的集合。包含最左的牛的区间只有一个，因此如果这头牛面朝前方，这个区间就不需要反转，反之，如果这头牛面朝后方，对应的区间就必须反转了。而且在此之后这个最左的区间就再也不需要考虑了。不断地重复下去就可以求出最少所需的翻转次数了。

import java.util.Scanner;

public class FaceTheRightWay {

    public static void main(String[] args) {
        Scanner in=new Scanner(System.in);
        n=in.nextInt();
        dir=new int[n];
        flag=new int[n];
        for (int i = 0; i < n; i++) {
            String str=in.next();
            if (str.equals("B")) {
                dir[i]=1;
            }else {
                dir[i]=0;
            }
        }
        slove();
        // TODO Auto-generated method stub

    }
    static int n;
    static int dir[];
    static int flag[];
    public static int calc(int k){
        for (int i = 0; i < n; i++) {
            flag[i]=0;
        }
        int res=0;
        int sum=0;
        for (int i = 0; i+k <=n; i++) {
            //计算区间 i i+k-1
            if ((dir[i]+sum)%2 !=0) {
                res++;
                flag[i]=1;
            }
            sum+=flag[i];
            if (i-k+1>=0) {
                sum-=flag[i-k+1];
            }
        }
        //检查剩下的牛是否有面朝后方的情况
        for (int i = n-k+1; i < n; i++) {
            if ((dir[i]+sum)%2 !=0) {
                return -1;
            }
            if (i-k+1>=0) {
                sum-=flag[i-k+1];
            }
        }
        return res;
    }
    public static void slove(){
        int K=1,M=n;
        for (int i = 1; i <= n; i++) {
            int m=calc(i);
            if (m>=0 && M>m) {
                M=m;
                K=i;
            }
        }
        System.out.println(K+" "+M);
    }
}