제출 #1117680

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1117680		vjudge1	Paprike (COI18_paprike)	C++17	13 / 100	9 ms	1320 KiB

paprike

#include <bits/stdc++.h>
#define GOOD_LUCK ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define itn int
#define INF 100000000
#define MOD 998244353
#define MAX 100003
#define endl "\n"
#define ff first
#define ss second
using namespace std;

int temp;
vector <int> v(MAX + 2), p(MAX + 2);

signed main() {

	GOOD_LUCK

    int t;
	t = 1;
//	cin >> t;
    while (t--) {
        int n, k;
        cin >> n >> k;
        for (int i=0; i < n; i++) {
        	cin >> v[i];
        	if (i == 0) p[i] = v[i];
        	else p[i] = p[i-1] + v[i];
		}
		int cnt=0, j=0;
		for (int i=0; i < n-1; i++) {
			if (p[i+1] - j > k) {
				j = p[i];
				cnt++;
			}
		}
		cout << cnt;
	}

    return 0;
}
// Problem A
// by Ekber_Ekber

• Subtask 1: 0 / 11
• Subtask 2: 13 / 13
• Subtask 3: 0 / 27
• Subtask 4: 0 / 49