题目链接:翻硬币
思路:正确的贪心策略--保证当前位置硬币朝向是正确的,如果不同,则翻转当前这枚和它的下一枚,一直保证当前硬币朝向是正确的。
AC代码:
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <utility>
#include <string>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
#define eps 1e-10
#define inf 0x3f3f3f3f
#define PI pair<int, int>
typedef long long LL;
const int maxn = 1000 + 5;
char a[maxn], b[maxn];
int main() {
while(scanf("%s%s", a, b) == 2) {
int ans = 0;
for(int i = 0; i < strlen(a) - 1; ++i) {
if(a[i] != b[i]) {
++ans;
if(a[i] == '*') a[i] = 'o';
else a[i] = '*';
if(a[i+1] == '*') a[i+1] = 'o';
else a[i+1] = '*';
}
}
printf("%d\n", ans);
}
return 0;
}
如有不当之处欢迎指出!