CodeForces

来源:互联网 发布:java鱼雷怎么样 编辑:程序博客网 时间:2024/06/03 12:50
#include<iostream>
#include<algorithm>#include<cstdio>#include<cstring>#include<vector>#include<stack>using namespace std;const int maxn = 100 + 7;int n;char s[maxn];int main() {    scanf("%d%s", &n, s);    int cnt1 = 0, cnt2 = 0;    for(int i = 1; i < n; ++i) {        if(s[i-1] == 'S' && s[i] == 'F') {            cnt1++;        }        else if(s[i-1] == 'F' && s[i] == 'S') {            cnt2++;        }    }    if(cnt1 > cnt2) puts("YES");    else puts("NO");        return 0;}