Language: C++

#include <bits/stdc++.h>
#include <cmath>
#include <set>
#include <cstdio>
#include <vector>
#include <iostream>
#include <utility>

#define fir first
#define sec second
#define pb push_back
#define get(n) scanf("%d",&n);
#define gets(s) string s;cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);
#define rep(i, j) for (int (i)=0;(i)<(j);(i)++)
#define repk(i, j, k) for(int (i)=(j);(i)<(k);(i)++)
#define repdown(i, j, k) for(int (i)=(j);(i)>=(j);(i)--)
#define dump(x)  std::cout << #x << " = " << (x) << std::endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

using ll = long long;
using vi = std::vector<int> ;
using vvi = std::vector<vi> ;
using vd = std::vector<double> ;
using vvd = std::vector<vd> ;
using qi = std::queue<int> ;
using vpii = std::vector<std::pair<int, int> >;
using namespace std;

const int Mod = 1e9 + 7;
const int max_n = 3 * 1e5 + 1;
const int max_m = 83 * 1e5 + 1;
const ll INF = 10241024;
long double INFD = 100100100;

//_________template______________
inline void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

inline void OUT(void){
  cout << "\n";
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

//_____________________array calc____________________________________//
/*
vvi mul(vvi &A, vvi &B){
  vvi C(A.size(), vi(B.size()))
  rep(i,A.size()){
    rep(j,B.size()){
      rep(k,B[0].size()){
        C[i][j] = (C[i][j] A[i][k] + B[k][j]) % Mod;
      }
    }
  }

  return C;
}

vvi pow(vvi A, ll n){
  vvi B(A.size(), vi(A.size()));
  rep(i=0;i<A.size();i++){
    B[i][i] = 1;
  }

  while (n >0){
    if (n & 1) B = mul(B, A);
    A = mul(A, A);
    n = n >> 1;
  }
  return B;
}
*/
//_____________________Bynary Indexed Tree __________________________//
/*
const max_st = (1 << 15) - 1;
int bit[max_st];
int sum (int i){
  int s = 0;
  while(i > 0){
    s += bit[i];
    i -= i & -i;
  }
  return s;
}

void add(int i, int x){
  while(i <= n){
    bit[i] += x;
    i += i & -i;
  }
}
*/
//_____________________　following sorce code_________________________//
string s;
void input(){
  IN(s);
}

void solve(){
  input();
  vi ans = 0;
  rep(i,2){
    {
      int ctn = 0;
      rep(j,n){
        if(s[j] == 'R')ctn++;
        else {
          ans[i] = floor(ctn/2);
          ans[i-1] = ceil(ctn / 2);
          ctn = 0;
        }
      }
    }
    reverse(s.begin(), s.end());
    reverse(ans.begin(), ans.end());
    rep(i,n){
      if(s[i] == 'R')s[i] = 'L';
      else s[i] = 'R';
    }
  }
  
  rep(i,n){
    OUT(ans[i]);
  }
}

int main () {
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
  return 0;
}




Compiler output:
a.cc: In function 'void solve()':
a.cc:121:12: error: conversion from 'int' to non-scalar type 'vi' {aka 'std::vector<int>'} requested
  121 |   vi ans = 0;
      |            ^
a.cc:125:13: error: 'n' was not declared in this scope
  125 |       rep(j,n){
      |             ^
a.cc:19:39: note: in definition of macro 'rep'
   19 | #define rep(i, j) for (int (i)=0;(i)<(j);(i)++)
      |                                       ^
a.cc:136:11: error: 'n' was not declared in this scope
  136 |     rep(i,n){
      |           ^
a.cc:19:39: note: in definition of macro 'rep'
   19 | #define rep(i, j) for (int (i)=0;(i)<(j);(i)++)
      |                                       ^
a.cc:142:9: error: 'n' was not declared in this scope
  142 |   rep(i,n){
      |         ^
a.cc:19:39: note: in definition of macro 'rep'
   19 | #define rep(i, j) for (int (i)=0;(i)<(j);(i)++)
      |                                       ^