Untitled
unknown
plain_text
a year ago
1.3 kB
7
Indexable
import java.util.Scanner;
public class Main {
static int N, K, maxRes;
static int[] lights = new int[100];
static int checkOffLight() {
int sum = 0;
for (int i = 0; i < N; i++) {
if (lights[i] == 0) sum++;
}
return sum;
}
static void doTurnOff(int k) {
for (int i = k; i < N; i += k + 2) {
lights[i] = lights[i] == 0 ? 1 : 0;
}
}
static void solve(int index, int k) {
maxRes = Math.max(maxRes, checkOffLight());
if (k == 3) return;
for (int i = index; i < K; i++) {
doTurnOff(i);
solve(i + 1, k + 1);
doTurnOff(i);
}
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int T = scanner.nextInt();
for (int t = 1; t <= T; t++) {
System.out.print("#" + t + " ");
N = scanner.nextInt();
K = scanner.nextInt();
for (int i = 0; i < N; i++) {
lights[i] = scanner.nextInt();
}
maxRes = checkOffLight();
solve(0, 0);
System.out.println(maxRes);
}
scanner.close();
}
}
Editor is loading...
Leave a Comment