AcWing 562. 壁画
原题链接
简单
作者:
春江花月夜ovo
,
2024-03-01 09:03:19
,
所有人可见
,
阅读 58
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
int t;
cin >> t;
for (int Ca = 1; Ca <= t; Ca ++)
{
int n;
cin >> n;
std::vector<int> pre(n + 1, 0);
string s;
cin >> s;
for (int i = 0; i < n; i ++)
{
pre[i + 1] = pre[i] + s[i] - '0';
}
int k = (n + 1) / 2;
int last = 0;
for (int i = k; i <= n; i ++)
{
last = max(last, pre[i] - pre[i - k]);
}
printf("Case #%d: %d\n", Ca, last);
}
return 0;
}