Submission #72372435

---

Source Code Expand

#include<bits/stdc++.h>
#define int long long
#define MSOD
//#define READ_IN_FILE
#define endl '\n'
#define FAST ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int N = 4e5 + 10, P = 998244353, MOD = 1e9 + 7, inf = 0x3f3f3f3f;
bool cmpbig(int i,int j)
{
	return i>j;
}
double mylog(int x,int y)
{
	return log(x)/log(y);
}
long long qpow(long long a,long long b,long long mod=LLONG_MAX)
{
	long long num=1;
	while(b)
	{
		if(b&1)num=num*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return num;
}
int n, w, s[2 * N], num[2 * N],ans;
void solve()
{
	cin >> n >> w;
	int mod = 2 * w, tn = 4 * w;
	for (int i = 0; i < mod; i++)num[i] = 0;
	for (int i = 1; i <= n; i++)
	{
		int tmp;
		cin >> tmp;
		num[i % mod] += tmp;
	}
	for (int i = 0; i < tn; i++)s[i + 1] = s[i] + num[i % mod];
  ans = 1e18;
	for (int i = 0; i + w <= tn; i++) {
		int cur = s[i + w] - s[i];
		ans=min(ans,cur);
	}
	cout << ans << endl;
}
signed main()
{
	FAST
#ifdef READ_IN_FILE
	freopen(".in",  "r", stdin);
	freopen(".out",  "w", stdout);
#endif
	int _T_ = 1;
#ifdef MSOD
	cin >> _T_;
#endif
	while (_T_--) solve();
	return 0;
}

Submission Info

Judge Result