제출 #125994

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
125994		streifi	과수원 (NOI14_orchard)	C++14	13 / 25	82 ms	10236 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];
		//cout << cum[m+1] << endl; 
	}
	int mxpos = M-1;
	int best = INF;
	for (int m = M-1; m >= 0; --m) {
		if (cum[m+1] > cum[mxpos+1])
			mxpos = m;
		int cur1 = (M-mxpos-1)+(cum[M]-cum[mxpos+1]);
		int cur2 = (mxpos-m+1)-(cum[mxpos+1]-cum[m]);
		int cur3 = m + cum[m];
		//cout << cur1 << " " << cur2 << " " << cur3 << endl;
		best = min(best, cur1+cur2+cur3);
	}
	cout << best/2 << endl;
}

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