-
Notifications
You must be signed in to change notification settings - Fork 1
/
CHEFSIGN.cpp
50 lines (47 loc) · 1.14 KB
/
CHEFSIGN.cpp
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
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
/* JULY 17
LONG CHALLENGE
Author: Richa
*/
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
int t;
char st[1000000];
int i=0;
scanf("%d",&t);
while(t--)
{
scanf(" %s",st);
int mx=1,cur=1,j=0,ct=0;
int len=strlen(st);
/* Checking the 1st letter */ ----Test case 1
if( st[0]=='=')
{
ct=1;
}
for(i=1;i<len;i++)
{
if(st[i]=='=') ----Test case 2
{++ct;continue;} //ignore all = sign and also count its frequency
if(st[i]==st[j] )
{cur=cur+1; //count length of same signs sequences
mx=max(mx,cur);
j=i; //j is last letter to be compared with this letter
}
else
{
cur=1;j=i;
}
}
if(mx==1 && ct==len) ----Test case 3
printf("1\n"); //if and all letters are '=' sign then ans=1
else
printf("%d\n",mx+1); //else ans is this
}//while
return 0;
}