题解 | #小苯的V图#

F题真的是本场除了AB外最简单的题目了吧

因为V放中间一定很好，O放边上一定很好

所以

枚举中间某块区域是V，剩下的边界是O ， 然后O(n^3)，就做完了

#include<bits/stdc++.h>
#include<vector>
#include<iostream>
#include<map>
#include<set>
#include<queue>
using namespace std;

#define ll long long
#define endl "\n"

void solve(){
    string s;cin>>s;
    int n = s.size();

    ll ans = 0;
    for(int i = 0;i<n;i+=1){
        for(int j = i ; j < n;j += 1){
            string t = s;
            for(int k = 0; k < n;k+=1){
                if(s[k] != '?') continue;
                if(k < i || k > j) t[k] = 'o';
                else t[k] = 'v';
            }
            vector<int> pre(n,t[0] == 'o') , suf(n,t[n-1] == 'o');
            for(int k = 1;k<n;k+= 1) pre[k ] = pre[k-1] + (t[k] == 'o');
            for(int k = n-2;k>=0;k -= 1) suf[k ] = suf[k+1] + (t[k] == 'o');
            ll tmp = 0;
            for(int k = 1; k < n - 1;k+=1){
                if(t[k] == 'v')
                    tmp += 1ll * pre[k-1] * suf[k+1];
            }
            ans = max(ans , tmp);
        }
    }
    cout<<ans<<endl;
}

signed main(){
    cin.tie(0);cout.tie(0);
    ios::sync_with_stdio(0);
    ll t;cin>>t;while(t--)
        solve();
}