CodeForces 801A Vicious Keyboard 模拟
2017-05-01 20:54
246 查看
题意:给定一个只含V和K两个字符的字符串。要求最多变化一个,从V到K,或者从K到V,最多能组成多少个VK 子串。
思路:长度只有100,暴力枚举每个字符变化,再求VK子串的数目,取其中最大的。
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
using namespace std;
int getvk(string s)
{
int n=s.size();
int ans=0;
for(int i=0;i<n-1;i++)
{
if(s[i]=='V'&&s[i+1]=='K')ans++;
}
return ans;
}
int main()
{
// freopen("in.txt","r",stdin);
string str;
cin>>str;
int num = getvk(str);
int len = str.size();
char ch,_ch;
int Max=num;
for(int i=0;i<len;i++)
{
_ch=str[i];
if(str[i]=='V')ch='K';
else ch='V';
str[i]=ch;
num=getvk(str);
if(M
4000
ax<num)Max=num;
str[i]=_ch;
}
cout<<Max<<endl;
}
思路:长度只有100,暴力枚举每个字符变化,再求VK子串的数目,取其中最大的。
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
using namespace std;
int getvk(string s)
{
int n=s.size();
int ans=0;
for(int i=0;i<n-1;i++)
{
if(s[i]=='V'&&s[i+1]=='K')ans++;
}
return ans;
}
int main()
{
// freopen("in.txt","r",stdin);
string str;
cin>>str;
int num = getvk(str);
int len = str.size();
char ch,_ch;
int Max=num;
for(int i=0;i<len;i++)
{
_ch=str[i];
if(str[i]=='V')ch='K';
else ch='V';
str[i]=ch;
num=getvk(str);
if(M
4000
ax<num)Max=num;
str[i]=_ch;
}
cout<<Max<<endl;
}
相关文章推荐
- Codeforces题目
- codeforces 438D
- CodeForces 596A-Wilbur and Swimming Pool
- codeforces--707B. Bakery
- CodeForces 780C Andryusha and Colored Balloons【DFS】
- CodeForces - 383 C. Propagating tree(dfs序+线段树/树状数组)
- Codeforces 40E Number Table - 组合数学
- codeforces 173C Spiral Maximum
- CodeForces - 484D Kindergarten
- CodeForces 630I(规律题)
- codeforces 710E Generate a String(dp)
- Codeforces 769C
- Codeforces 842B 简单几何
- Codeforces 870C
- codeforces 256ELucky Arrays(线段树)
- codeforces 339C Xenia and Weights(dp或暴搜)
- Codeforces 472G Design Tutorial: Increase the Constraints(分块+FFT)
- 【Educational Codeforces Round 16】Codeforces 710C Magic Odd Square
- Codeforces 675D Tree Construction【思维+set】
- Codeforces-809C Find a car(分治)