제출 #125984

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

orchard

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

const int INF = 0x3f3f3f3f;

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int N, M;
	cin >> N >> M;
	
	vector<int> v(M), cum(M+1, 0);
	for (int m = 0; m < M; ++m) {
		cin >> v[m];
		if (v[m] == 0) v[m] = -1;
		cum[m+1] = cum[m]+v[m];
	}
	int mxpos = M;
	int best = INF;
	for (int m = M; m > 0; --m) {
		int cur = (M-mxpos)+(cum[M]-cum[mxpos]) + (mxpos-m)-(cum[mxpos]-cum[m]) + m + cum[m];
		best = min(best, cur);
	}
	cout << best << 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