USACO题解源代码 - JAVA

'w'){
break;
}
}
return i-1;
} else {
int i=startPoint-1;
for (;i>=endPoint+1;i--){
if (necklace.get(i)!=necklace.get(startPoint)&&necklace.get(i)!='w'){
break;
}
}
return i+1;
}
}

}

package Karl.Water;

/*
LANG: JAVA
TASK: beads
*/

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.LinkedList;

public class beads {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
try {
BufferedReader br = new BufferedReader(new FileReader("beads.in"));
PrintWriter pw = new PrintWriter (new FileWriter("beads.out"));

int length = Integer.parseInt(br.readLine());
String temp = br.readLine();
LinkedList necklace = new LinkedList();
for (int i=0;i necklace.add(temp.charAt(i));
}

int max = 0;
for (int i=0;i char remove = necklace.removeFirst();
char first = necklace.getFirst();
int position = 0;
necklace.addLast(remove);

int result = 0;
boolean allW = false;
if (necklace.getFirst()=='w'){
int end1 = find(necklace,0,length,0);
result = end1 + 1;
if (end1 int end2 = find (necklace,end1+1,length,0);
first = necklace.get(end2);
position = end2;
result = result + end2 - end1;
}else {
allW = true;
}
} else {
int end = find(necklace,0,length,0);
position = end ;
result = result + end + 1;
}
if (!allW){
if (necklace.getLast()=='w') {
int end1 = find(necklace, length-1,position,1);
int end2 = find(necklace,end1-1,position,1);

if (necklace.get(end2)==first){
result = result ;
}else {
result = result + length - end1;
result = result + end1 - end2 ;
}
}else {
if (necklace.getLast()==first){
result = result;
}else {
int end = find(necklace,length-1,position,1);
result = result + length - end ;
}
}
}
if (result >=max){
max = result;
}
}
pw.println(max);
pw.close();
br.close();
} catch (Exception e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}

public static int find(LinkedList necklace,int startPoint ,int endPoint,int direction){
if (direction ==0 ){
int i=startPoint+1;
for (;i<=endPoint-1;i++){
if (necklace.get(i)!=necklace.get(startPoint)&&necklace.get(i)!='w'){
break;
}
}
return i-1;
} else {
int i=startPoint-1;
for (;i>=endPoint+1;i--){
if (necklace.get(i)!=necklace.get(startPoint)&&necklace.get(i)!='w'){
break;
}
}
return i+1;
}
}

}
（2）

[java]
package Karl.Water;

/*
LANG: JAVA
TASK: friday
*/

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;

public class friday {
public static void main(String[] args) throws IOException {
int mon=0;
int tue=0;
int win=0;
int thur=0;
int fri=0;
int sat=0;
int sun=0;
int j=0;
int [][

USACO题解源代码 (二)