제출 #124578

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
124578		streifi	과수원 (NOI14_orchard)	C++14	0 / 25	1069 ms	6228 KiB

orchard

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

const int INF = 0x3f3f3f3f;

signed main() {
	int N, M;
	cin >> N >> M;
	vector<int> cum(M+2, 0);
	for (int m = 0; m < M; ++m) {
		int X;
		cin >> X;
		cum[m+1] = cum[m]+X;
	}
	cum[M+1] = cum[M];
	int fee = INF;
	for (int i = 0; i <= M; ++i) {
		for (int j = i+1; j <= M+1; ++j) {
			int a = cum[i];
			int b = (j-i)-(cum[j]-cum[i]);
			cout << b << endl;
			int c = cum[M+1]-cum[j];
			fee = min(fee, a+b+c);
		}
	}
	cout << fee << endl;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 5
• Subtask 4: 0 / 3
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5