Submission #6411091

---

Source Code Expand

#include <iostream>
#include <map>

using namespace std;

map<string, int> m;

int solve(string s) {

    if(m[s] > 0)
        return m[s];
    if(s.size() < 3)
        return 0;

    int ans = 0;
    for(int i = 1; i < s.size() - 1; i++) {
        if(s[i] == 'w' and s[i - 1] == 'i' and s[i + 1] == 'i') {
            // cout << s << " -> " << s.substr(0, i - 1) << " + "
            //      << s.substr(i + 2) << endl;
            ans = max(ans, solve(s.substr(0, i - 1) + s.substr(i + 2)) + 1);
        }
    }

    return m[s] = ans;
}

int main() {
    string s;
    cin >> s;

    cout << solve(s) << endl;
    return 0;
}

Submission Info

Judge Result