Submission #20,663

20663

2026-01-08 15:35:28

cpp17

Accepted 50/50

19ms

1200 KiB

#include <iostream>
#include <vector>
using namespace std;

int main()
{
    long long n, k, maxl=0;
    cin >> n >> k;
    vector<int> v(n+1), ossz(n+1);

    for (int i=1; i <= n; i++) {
        cin >> v[i];
        ossz[i] = ossz[i - 1]+v[i];
        if (ossz[i]>=k && v[i]) {
            maxl = maxl+ (ossz[i]-k+1);
        }
    }
    cout << maxl;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	1ms	508 KiB
		2	Accepted	0/0	1ms	316 KiB
		3	Accepted	0/0	18ms	1076 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Accepted	2/2	1ms	316 KiB
		7	Accepted	3/3	1ms	316 KiB
		8	Accepted	3/3	1ms	316 KiB
		9	Accepted	3/3	1ms	316 KiB
		10	Accepted	2/2	1ms	316 KiB
		11	Accepted	3/3	1ms	316 KiB
		12	Accepted	2/2	1ms	316 KiB
		13	Accepted	3/3	1ms	332 KiB
		14	Accepted	2/2	17ms	1080 KiB
		15	Accepted	2/2	17ms	1156 KiB
		16	Accepted	3/3	18ms	1168 KiB
		17	Accepted	3/3	17ms	1152 KiB
		18	Accepted	3/3	18ms	1076 KiB
		19	Accepted	3/3	17ms	1200 KiB
		20	Accepted	3/3	17ms	1076 KiB
		21	Accepted	3/3	19ms	1196 KiB
		22	Accepted	3/3	17ms	1200 KiB