Submission #4063045

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cassert>
#include <cstring>
#include <climits>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define mp make_pair
#define fi first
#define se second
#define pb push_back

typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;

constexpr ll INF = 1e18;
constexpr ll MOD = 1e9 + 7;
constexpr double PI = 3.14159265358979323846;
constexpr int di[] = {0, 0, 1, -1};
constexpr int dj[] = {1, -1, 0, 0};

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    string s;

    cin >> n >> s;

    s = s + "00000";

    int res = 0;

    int i = 0;

    V v;

    while (i < n)
    {
        if (s[i] == '0')
        {
            i++;
            continue;
        }

        int cnt = 0;

        while (i < n && s[i] == '1')
            i++, cnt++;

        v.push_back(cnt);

        if (s[i + 1] == '0')
        {
            if (v.size() > 1)
            {
                int t1 = 0, t2 = 0;

                for (int j = 0; j < v.size() - 1; j += 2)
                    t1 += max(v[j], v[j + 1]);

                for (int j = 1; j < v.size() - 1; j += 2)
                    t2 += max(v[j], v[j + 1]);

                res += max(t1, t2);
            }

            v.clear();
        }
    }

    cout << res << endl;

    return 0;
}

Submission Info

Judge Result