POJ 3617 Best Cow Lineを解く

3617 -- Best Cow Line

→Dequeつかってやる
なんかバグる
→ふつうにポインタっぽいことすればええんや

import java.util.Scanner;
public class Main {
  public static void main(String[] args) {
    Scanner stdIn = new Scanner(System.in);
    int N = stdIn.nextInt();
    char[] s = new char[N];
    for(int i = 0; i < N; i++) {
      String tmp = stdIn.next();
      s[i] = tmp.charAt(0);
    }
    
    int a = 0;
    int b = N-1;
    String ans = "";
    
    while(a <= b) {
      for(int i = 0; i < N; i++) {
        int L = s[a + i] - 'A';
        int R = s[b - i] - 'A';
        if(L < R) {
          ans += s[a++];
          break;
        }
        if(L > R) {
          ans += s[b--];
          break;
        }
        if(a+i >= b-i) {
          ans += s[a++];
          break;
        }
      }
    }
    for(int i = 0; i < ans.length(); i+= 80) {
      for(int j = 0; j < 80 && (i + j) < ans.length(); j++) {
        System.out.print(ans.charAt(i + j));
      }
      System.out.println();
    }
    
    
    
    
    
  }

}