hihocoder 1258 Osu! Master

题目链接：J题

题目大意：给你一些操作，C和B后面跟数字，S不跟，问有多少组操作，S算大圈，直接算一组，B和C算同样的一组操作，但是序号必须得递增，否则就是另一组的

题目思路：直接按题意模拟就好了

#include <map>#include <set>#include <cmath>#include <queue>#include <stack>#include <vector>#include <cstdio>#include <cstring>#include <cstdlib>#include <iostream>#include <algorithm>using namespace std;typedef long long ll;const int maxn = 1e6+10;const int INF = 0x3f3f3f3f;int main(){    int n,m,num,fro,cot;    char op;    while(~scanf("%d",&n)){        fro = INF,cot = 0;        for(int i = 1;i <= n;i++){            scanf(" %c",&op);            if(op == 'C'||op == 'B'){                scanf("%d",&num);                if(num <= fro){                    cot++;                    fro = num;                }                else fro = num;            }            else{                cot++,fro = INF;            }        }        printf("%d\n",cot);    }    return 0;}