Accepted
Code
#include <stdio.h>
int main() {
int t; scanf("%d", &t);
while (t--) {
int n, k, d, i, sum = 0, best = -1, lu = -1;
scanf("%d %d %d", &n, &k, &d);
int a[n];
for (i = 0; i < n; i++) scanf("%d", &a[i]);
for (i = 0; i < k; i++) sum += a[i];
if (sum % d == 0) best = (sum == k), lu = 0;
for (i = k; i < n; i++) {
sum += a[i] - a[i - k];
if (sum % d == 0 && ((sum == k && best < 1) || (best == -1)))
best = (sum == k), lu = i - k + 1;
}
printf("%d\n", lu == -1 ? -1 : lu + 1);
}
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1190 Segment Strength
- Contest
- Brain Booster #9
- Language
- C99 (GCC 13.2.0)
- Submit At
- 2025-04-06 17:00:13
- Judged At
- 2025-04-06 17:00:13
- Judged By
- Score
- 100
- Total Time
- 23ms
- Peak Memory
- 1.172 MiB