[Offer收割]编程练习赛107 register

Ended

Participants:61

Verdict:Accepted
Score:100 / 100
Submitted:2019-09-01 12:38:52

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
#include <bits/stdc++.h>
using namespace std;
string n;
int l;
int dp[1000005];
int main()
{
    cin>>n;
    l=n.length();
    int ans=0;
    dp[1]=1;
    dp[2]=2;
    for(int i=3;i<=l;i++)
        if(n[i-3]==n[i-2]&&n[i-2]==n[i-1])
            dp[i]=2;
        else dp[i]=dp[i-1]+1;
    for(int i=1;i<=l;i++)
        ans=max(ans,dp[i]);
    cout<<ans<<endl;
    return 0;
}
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX