Codeforces 67A. Partial Teacher

贪心

A. Partial Teacher

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

A teacher decides to give toffees to his students. He asks n students to stand in a queue. Since the teacher is very partial, he follows the following rule to distribute toffees.

He looks at the first two students and gives more toffees to the student having higher marks than the other one. If they have the same marks they get the same number of toffees. The same procedure is followed for each pair of adjacent students starting from the first one to the last one.

It is given that each student receives at least one toffee. You have to find the number of toffees given to each student by the teacher such that the total number of toffees is minimum.

Input

The first line of input contains the number of students n (2 ≤ n ≤ 1000). The second line gives (n - 1) characters consisting of "L", "R" and "=". For each pair of adjacent students "L" means that the left student has higher marks, "R" means that the right student has higher marks and "=" means that both have equal marks.

Output

Output consists of n integers separated by a space representing the number of toffees each student receives in the queue starting from the first one to the last one.

Sample test(s)

input

5
LRLR

output

2 1 2 1 2

input

5
=RRR

output

1 1 2 3 4

/**
 * Created by ckboss on 14-9-3.
 */

import java.util.*;

public class N {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] toffee = new int[n + 10];
        in.nextLine();
        String array = in.nextLine();
        for (int i = 0; i < n - 1; i++) {
            int a = i + 1, b = i + 2;
            if (toffee[a] == 0) toffee[a]++;
            if (toffee[b] == 0) toffee[b]++;

            if (array.charAt(i) == 'L') {
                while (toffee[a] <= toffee[b])
                    toffee[a]++;
                int pre = a - 1, now = a, id = i - 1;
                for (int j = pre; j >= 1; j--) {
                    if (array.charAt(id) == 'L') {
                        while (toffee[pre] <= toffee[now])
                            toffee[pre]++;
                    } else if (array.charAt(id) == '=') {
                        while (toffee[pre] < toffee[now])
                            toffee[pre]++;
                    } else break;
                    id--;
                    now = pre;
                    pre--;
                }
            } else if (array.charAt(i) == 'R') {
                while (toffee[b] <= toffee[a])
                    toffee[b]++;
            } else if (array.charAt(i) == '=') {
                if (toffee[a] < toffee[b]) {
                    while (toffee[a] < toffee[b])
                        toffee[a]++;
                    int pre = a - 1, now = a, id = i - 1;
                    for (int j = pre; j >= 1; j--) {
                        if (array.charAt(id) == 'L') {
                            while (toffee[pre] <= toffee[now])
                                toffee[pre]++;
                        } else if (array.charAt(id) == '=') {
                            while (toffee[pre] < toffee[now])
                                toffee[pre]++;
                        } else break;
                        id--;
                        now = pre;
                        pre--;
                    }
                } else if (toffee[b] < toffee[a]) {
                    while (toffee[b] < toffee[a])
                        toffee[b]++;
                }
            }
        }

        for (int i = 1; i <= n; i++) {
            System.out.print(toffee[i] + " ");
        }
    }
}