rt，WA了第三个点

代码如下：

#include<bits/stdc++.h>
using namespace std;
int n,a[105],f[105][105],g[105][105];
char c[105];
int main()
{
    cin>>n;
    memset(g,0x3f3f3f3f,sizeof(g));
    memset(f,-1e9,sizeof(f));
    for(int i=1;i<=n;i++) cin>>c[i]>>a[i],a[i+n]=a[i],c[i+n]=c[i];
    for(int i=1;i<=2*n;i++) f[i][i]=g[i][i]=a[i];
    for(int len=1;len<=2*n;len++)
    {
        for(int i=1;i<=2*n;i++) 
        {
            int j=i+len-1;
            if(j<=2*n)
            {
                for(int k=i;k<j;k++)
                {
                    if(c[k+1]=='t')
                    {
                        f[i][j]=max(f[i][j],f[i][k]+f[k+1][j]);
                        g[i][j]=min(g[i][j],g[i][k]+g[k+1][j]);
                    }else
                    {
                        f[i][j]=max(f[i][j],max(f[i][k]*f[k+1][j],max(g[i][k]*g[k+1][j],max(f[i][k]*g[k+1][j],g[i][k]*f[k+1][j]))));
                        g[i][j]=min(g[i][j],min(f[i][k]*f[k+1][j],min(g[i][k]*g[k+1][j],min(f[i][k]*g[k+1][j],g[i][k]*f[k+1][j]))));
                    }
                }
            }
        }
    }
    int ans=-1e9;
    for(int i=1;i<=n;i++) ans=max(ans,f[i][i+n-1]);
    cout<<ans<<endl;
    for(int i=1;i<=n;i++)
    {
        if(ans==f[i][i+n-1]) cout<<i<<' ';
    }
    return 0;
}

球跳悬棺