Submission #6691009

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<unordered_set>
#include<unordered_map>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define mad(a,b) a=(a+b)%mod;
ll ans[200010];
int main(){
  string s; cin>>s; s+="R";
  for(int i=0;i<s.size();i++)ans[i]=0;
  ll a=1,b=0,pl=-1;
  for(int i=1;i<s.size();i++){
      if(s[i-1]=='L'&&s[i]=='R'){
	  ans[pl]=(a+1)/2+b/2;
	  ans[pl+1]=a/2+(b+1)/2;
	  a=1,b=0,pl=-1;
	  continue;
      }
      if(s[i]=='L')b++;
      if(s[i]=='R')a++;
      if(s[i-1]=='R'&&s[i]=='L')pl=i-1;
  }
  for(int i=0;i<s.size()-1;i++)cout<<ans[i]<<endl;
  return 0;
}

Submission Info

Judge Result