2018校招 DNA序列 80%通过

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {

public static void main(String[] args) {
	Scanner scanner=new Scanner(System.in);
	String string=scanner.nextLine();
	//int a1,a2,a3,a4;
	int sum1=0,sum2=0,sum3=0,sum4=0;
    int count;
	for (int i = 0; i < string.length(); i++) {
		count=0;
		if (string.charAt(i)=='A') {
            count++;
            if (count>sum1) {
						sum1=count;
					}
			for (int j = i+1; j <string.length(); j++) {
				if (string.charAt(j)=='A') {
					count++;
					if (count>sum1) {
						sum1=count;
					}
				}else{
                    break;
                }
			}
		}
		if (string.charAt(i) == 'G') {
            count++;
            if (count>sum2) {
						sum2=count;
					}
			for (int j = i+1; j <string.length(); j++) {
				if (string.charAt(j)=='G') {
					count++;
					if (count>sum2) {
						sum2=count;
					}
				}else{
                    break;
                }
			}
		}
		if (string.charAt(i) == 'C') {
            count++;
            if (count>sum3) {
						sum3=count;
					}
			for (int j = i+1; j <string.length(); j++) {
				if (string.charAt(j)=='C') {
					count++;
					if (count>sum3) {
						sum3=count;
					}
				}else{
                    break;
                }
			}
		}
		if (string.charAt(i) == 'T') {
            count++;
            if (count>sum4) {
						sum4=count;
					}
			for (int j = i+1; j <string.length(); j++) {
				if (string.charAt(j)=='T') {
					count++;
					if (count>sum4) {
						sum4=count;
					}
				}else{
                    break;
                }
			}
		}
	}
	System.out.println(Math.min(Math.min(sum1, sum2), Math.min(sum3, sum4))+1);
}

}