백준 2810번: 컵홀더

https://www.acmicpc.net/problem/2810

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
 
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    int n; cin >> n;
    string s; getline(cin, s);
    getline(cin, s);
 
    int sol = 1;
    if (n > 1) {
 
        for (int i=0; i<n; i++) {
            if (s[i] == 'S') {
                sol++;
            } else {
                i++, sol++;
            }
        }
    }
 
    if (n > sol) {
        cout << sol << CENDL;
    } else {
        cout << n << CENDL;
    }
 
    return 0;
}