[ An Ac a Day ^_^ ] UVALive 7270 Osu! Master

2015icpc北京区域赛的签到题

还是很签到的 一次就过了

题意呢

就是统计B C后最长上升序列还有S的个数

当然B C要被S分割开……

 /* ***********************************************
 Author        :Sun Yuefeng
 Created Time  :2016/10/16 18:41:24
 File Name     :A.cpp
 ************************************************ */

 #include<cstdio>
 #include<iostream>
 #include<algorithm>
 #include<cmath>
 #include<cstring>
 #include<string>
 #include<bitset>
 #include<map>
 #include<set>
 #include<stack>
 #include<vector>
 #include<queue>
 #include<list>
 #define M(a,b) memset(a,b,sizeof(a))
 using namespace std;
 typedef long long ll;
 const int inf=0x3f3f3f3f;
 const int maxn=1e9+;
 const int mod=1e7+;
 int dx[]= {,,,-,,-,,-};
 int dy[]= {,-,,,-,,,-};

 int main()
 {
     //freopen("in.txt","r",stdin);
     //freopen("out.txt","w",stdout);
     int n;
     while(~scanf("%d",&n)){
         int ans=,last=-;
         while(n--){
             char a;
             cin>>a;
             if(a=='S'){
                 ans++;
                 last=-;
             }
             else{
                 int a;
                 scanf("%d",&a);
                 if(a>last){
                     if(last==-) ans++;
                     last=a;
                 }
                    else{
                     last=a;
                     ans++;
                 }
             }
         }
         printf("%d\n",ans);
     }
     return ;
 }