45 lines
774 B
Java
45 lines
774 B
Java
package chelper;
|
|
|
|
import io.InputReader;
|
|
import io.OutputWriter;
|
|
import misc.SavingChelperSolution;
|
|
|
|
|
|
public class TaskB extends SavingChelperSolution {
|
|
|
|
public void solve(int testNumber, InputReader in, OutputWriter out) {
|
|
wrapSolve(testNumber, in, out);
|
|
}
|
|
|
|
@Override
|
|
public void solve(int testNumber) {
|
|
out.printf("Case #%d: ", testNumber);
|
|
|
|
int n = in.nextInt();
|
|
|
|
String s = in.nextString();
|
|
|
|
int[] a = new int[n];
|
|
|
|
for (int i = 0; i < n; i++) {
|
|
a[i] = s.charAt(i) - '0';
|
|
}
|
|
|
|
int k = (n + 1) / 2;
|
|
|
|
int sum = 0;
|
|
|
|
for (int i = 0; i < k; i++) {
|
|
sum += a[i];
|
|
}
|
|
int max = sum;
|
|
|
|
for (int i = k; i < n; i++) {
|
|
sum += a[i] - a[i - k];
|
|
max = Math.max(max, sum);
|
|
}
|
|
|
|
out.println(max);
|
|
}
|
|
}
|