Submission #1847416

---

Source Code Expand

#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x)  cerr << #x << " = " << (x) << endl;
//const int INF = 1e8;
using namespace std;

int oddVector(vector<int> v){
	int res = 0;
	auto it = min_element(all(v));
	for (auto i = v.begin(); i != it; i+=2) {
		res += max(*i, *next(i,1));
	}
	for (auto i = next(it,1); i != v.end(); i+=2) {
		res += max(*i, *next(i,1));
	}
	return res;
}

int countOp(vector<int> v){
	if(v.size() % 2){
		return oddVector(v);
	}else{
	}
}

int main(){
	int n;
	string s;
	cin >> n >> s;
	s+="0";

	vector<int> v;
	int cnt = 0, ans = 0;
	rep(i,s.size()){
		if(s[i] == '1'){
			cnt++;
		}else if(s[i] == '0'){
			v.emplace_back(cnt);
			cnt = 0;
		}
	}

	//for(auto j : v){ cout << j << ' '; } cout << endl;

	vector<int> dp(v.size(), 0);
	dp[1] = max(v[0], v[1]);
	range(i,1,v.size() - 1){
		dp[i + 1] = max(dp[i + 1], dp[i]);
		if(v[i] == 0 || v[i + 1] == 0) continue;
		//for(auto j : dp){ cout << j << ' '; } cout << endl;
		dp[i + 1] = max(dp[i + 1], dp[i - 1] + max(v[i], v[i + 1]));
	}
		//for(auto j : dp){ cout << j << ' '; } cout << endl;

	cout << dp[v.size() - 1] << endl;
}

Submission Info

Judge Result