Problem:
Score : 100 points

Problem Statement

We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.

Find the maximum number of consecutive rainy days in this period.

Constraints

|S| = 3

Each character of S is S or R.

Input

Input is given from Standard Input in the following format:

S

Output

Print the maximum number of consecutive rainy days in the period.

Sample Input 1

RRS

Sample Output 1

2

We had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.

Sample Input 2

SSS

Sample Output 2

0

It was sunny throughout the period. We had no rainy days, so we should print 0.

Sample Input 3

RSR

Sample Output 3

1

We had rain on the 1-st and 3-rd days - two "streaks" of one rainy day, so we should print 1.

Solution in C (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<stdio.h>
int buble(int a, int b[200]){
   int j,i,tmp;
  for(i=0;i<a;i++){
 	 for(j=0;j<a;j++){
   		 if(b[i]>b[j]){
  	   	   tmp=b[i];
   		   b[i]=b[j];
   		   b[j]=tmp;    
		  }
 	 }
  }
   return b;
  }
int main(){
  int N=0,L[200]={},p=0,q=0,d=0,e=0,f=0,count=0;
  scanf("%d",&N);
  for(p=0;p<=N;p++){
  scanf("%d",&L[p]);
  }
  L[200]=buble(N,L);
  p=(N*N*N-3*N*N+2*N)/6;
  for(d=0;d<N;d++){
    for(e=d+1;e<N;e++){
      for(f=e+1;f<N;f++){
  if(L[d]>=L[e]+L[f]||L[d]==L[e]||L[e]==L[f]){
    count++;
  }
      }
    }
  }
  count=p-count;
  printf("%d",count);
  return 0;
}