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] + " ");
}
}
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
다양한 언어의 JSONJSON은 Javascript 표기법을 사용하여 데이터 구조를 레이아웃하는 데이터 형식입니다. 그러나 Javascript가 코드에서 이러한 구조를 나타낼 수 있는 유일한 언어는 아닙니다. 저는 일반적으로 '객체'{}...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.