题解 | 小苯的ovo2.0

import java.util.*;

public class Main{
    static Scanner in = new Scanner(System.in);
    static long cal(String s){
        long a = 0;
        long b = 0;
        long res = 0;
        for(int i = 0; i < s.length(); i++){
            if(s.charAt(i) == 'o'){
                a ++;
                res += b;
            }
            else{
                b += a;
            }
        }
        return res;
    }
    static void solve(){
        String s = in.nextLine();
        int n = s.length();
        int[] v = new int[n+5];
        int cnt = 0;
        for(int i = 0; i < n; i++)
            if(s.charAt(i) == '?'){
                v[++cnt] = i;
                s = s.substring(0, i) + "o" + s.substring(i+1);
            }
        long ans = cal(s);
        for(int i = 1; i <= cnt ; i ++){
            String s1 = s;
            for(int j = i; j <= cnt; j ++){
                s1 = s1.substring(0,v[j]) + "v" + s1.substring(v[j]+1);
                ans = Math.max(ans, cal(s1));
            }
        }
        System.out.println(ans);
    }
    public static void main(String[] args){
        int T = in.nextInt();
        String ss = in.nextLine();
        while(T-- > 0) solve();
    }
}