P3741 honoka的键盘

水

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int n,ans;
char a[109];
int main()
{
    scanf("%d",&n);
    cin>>a;
    int s=0;
    for(int j=0;j<n;j++)
    {
        if(a[j]=='V'&&a[j+1]=='K') s++,j++;
    }
    ans=max(ans,s);
    for(int i=0;i<n;i++)
    {
        s=0;
        if(a[i]=='K') a[i]='V';else a[i]='K';
        for(int j=0;j<n;j++)
        {
            if(a[j]=='V'&&a[j+1]=='K') s++,j++;
        }
        if(a[i]=='K') a[i]='V';else a[i]='K';
        ans=max(ans,s);
    } 
    printf("%d",ans);
    return 0;
}

转载于:https://www.cnblogs.com/dfsac/p/7587839.html