제출 #241650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
241650		dung11112003	Laugh Analysis (IOI16_laugh)	C++11	100 / 100	19 ms	6144 KiB

laugh

#include <bits/stdc++.h>
#include "laugh.h"

#define taskname ""
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define for0(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)

using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex <ld> cd;
typedef vector <cd> vcd;
typedef vector <int> vi;

template<class T> using v2d = vector <vector <T> >;
template<class T> bool uin(T &a, T b)
{
    return a > b ? (a = b, true) : false;
}
template<class T> bool uax(T &a, T b)
{
    return a < b ? (a = b, true) : false;
}

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

const int maxN = 1e5 + 10;

int longest_laugh(string s)
{
    int n = (int)s.size();
    vector <vector <int>> dp(n + 1, vector <int> (2));
    for1(i, n)
    {
        if (s[i - 1] == 'h')
        {
            dp[i][1] = dp[i - 1][0] + 1;
        }
        if (s[i - 1] == 'a')
        {
            dp[i][0] = dp[i - 1][1] + 1;
        }
    }
    int ans = 0;
    for (auto &d: dp)
    {
        for (auto &x: d)
        {
            uax(ans, x);
        }
    }
    return ans;
}

• Subtask 1: 21 / 21
• Subtask 2: 26 / 26
• Subtask 3: 53 / 53