# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
543501 | 2022-03-30T19:04:46 Z | Sho10 | Laugh Analysis (IOI16_laugh) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho using ll=long long; using ld=long double; int const INF=1000000005; ll const LINF=1000000000000000005; ll const mod=1000000007; ld const PI=3.14159265359; ll const MAX_N=3e5+5; #pragma GCC optimize("O3") #pragma GCC optimize("Ofast") #define f first #define s second #define pb push_back #define mp make_pair #define endl '\n' #define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); using namespace std; ll n,dp[3][100005]; string s; int32_t main(){ CODE_START; #ifdef LOCAL ifstream cin("input.txt"); #endif cin>>s; ll n=s.size(); s=" "+s; ll ans=0; for(ll i=1;i<=n;i++) { dp[1][i]=0; dp[2][i]=0; if(s[i]=='a'){ dp[1][i]=max(dp[1][i],dp[2][i-1]+1); } if(s[i]=='h'){ dp[2][i]=max(dp[2][i],dp[1][i-1]+1); } } for(ll i=1;i<=n;i++) { ans=max(ans,max(dp[1][i],dp[2][i])); } cout<<ans<<endl; }