くんと変なじゃんけん / AtCoDeer and Rock-Paper （AtCoder-2141）

Problem Description

AtCoDeer the deer and his friend TopCoDeer is playing a game. The game consists of N turns. In each turn, each player plays one of the two gestures, Rock and Paper, as in Rock-paper-scissors, under the following condition:

(※) After each turn, (the number of times the player has played Paper)≦(the number of times the player has played Rock).

Each player's score is calculated by (the number of turns where the player wins) − (the number of turns where the player loses), where the outcome of each turn is determined by the rules of Rock-paper-scissors.

(For those who are not familiar with Rock-paper-scissors: If one player plays Rock and the other plays Paper, the latter player will win and the former player will lose. If both players play the same gesture, the round is a tie and neither player will win nor lose.)

With his supernatural power, AtCoDeer was able to foresee the gesture that TopCoDeer will play in each of the N turns, before the game starts. Plan AtCoDeer's gesture in each turn to maximize AtCoDeer's score.

The gesture that TopCoDeer will play in each turn is given by a string s. If the i-th (1≦i≦N) character in s is g, TopCoDeer will play Rock in the i-th turn. Similarly, if the i-th (1≦i≦N) character of s in p, TopCoDeer will play Paper in the i-th turn.

Constraints

• 1≦N≦105
• N=|s|
• Each character in s is g or p.
• The gestures represented by s satisfy the condition (※).

Input

The input is given from Standard Input in the following format:

s

Output

Print the AtCoDeer's maximum possible score.

Example

Sample Input 1

gpg

Sample Output 1

0
Playing the same gesture as the opponent in each turn results in the score of 0, which is the maximum possible score.

Sample Input 2

ggppgggpgg

Sample Output 2

2
For example, consider playing gestures in the following order: Rock, Paper, Rock, Paper, Rock, Rock, Paper, Paper, Rock, Paper. This strategy earns three victories and suffers one defeat, resulting in the score of 2, which is the maximum possible score.

题意：

两个人玩石头剪刀布，一个人出石头一个人出布，赢了的得分，输了的扣分，平了不得分，现在已经知道对方出石头和布的步骤，要求每次出一个石头和布都要保证当前出过石头次数大于出过布的次数，问最后得分

思路：

模拟即可，要注意的是，由于每一轮都要进行比较，第一轮的时候石头、布的计数均为 0，因此第一次必须出石头，之后根据石头出的次数可以知道是否可以出布

Source Program

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#define EPS 1e-9
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define LL long long
const int MOD = 1E9+7;
const int N = 1000000+5;
const int dx[] = {0,0,-1,1,-1,-1,1,1};
const int dy[] = {-1,1,0,0,-1,1,-1,1};
using namespace std;

string str;
int main() {
    cin>>str;
    int len=str.size();

    int g=0,p=0;
    int res=0;
    for(int i=0; i<len; i++){
        if(str[i]=='g'){
            if(p<g){
                res++;
                p++;
            }
            else
                g++;
        }
        else{
            if(p>g){
                g++;
                res--;
            }
            else
                p++;
        }
    }
    printf("%d\n",res);
    return 0;
}