New Year Present

最新推荐文章于 2017-08-30 23:40:27 发布

踢树叶

最新推荐文章于 2017-08-30 23:40:27 发布

阅读量544

点赞数

分类专栏： AC路漫漫

本文链接：https://blog.csdn.net/geekdoe/article/details/50413998

版权

AC路漫漫专栏收录该内容

180 篇文章 1 订阅

订阅专栏

Description

The New Year is coming! That's why many people today are busy preparing New Year presents. Vasily the Programmer is no exception.

Vasily knows that the best present is (no, it's not a contest) money. He's putn empty wallets from left to right in a row and decided how much money to put in what wallet. Vasily decided to puta_i coins to thei-th wallet from the left.

Vasily is a very busy man, so the money are sorted into the bags by his robot. Initially, the robot stands by the leftmost wallet in the row. The robot can follow instructions of three types: go to the wallet that is to the left of the current one (if such wallet exists), go to the wallet that is to the right of the current one (if such wallet exists), put a coin to the current wallet. Due to some technical malfunctions the robot cannot follow two "put a coin" instructions in a row.

Vasily doesn't want to wait for long, so he wants to write a program for the robot that contains at most10⁶ operations (not necessarily minimum in length) the robot can use to put coins into the wallets. Help him.

Input

The first line contains integer n(2 ≤ n ≤ 300) — the number of wallets. The next line containsn integers a₁, a₂, ..., a_n(0 ≤ a_i ≤ 300).

It is guaranteed that at least one a_i is positive.

Output

Print the sequence that consists of k(1 ≤ k ≤ 10⁶) characters, each of them equals: "L", "R" or "P". Each character of the sequence is an instruction to the robot. Character "L" orders to move to the left, character "R" orders to move to the right, character "P" orders the robot to put a coin in the wallet. The robot is not allowed to go beyond the wallet line. In other words, you cannot give instructions "L" if the robot is at wallet 1, or "R" at walletn.

As a result of the performed operations, the i-th wallet from the left must contain exactlya_i coins. If there are multiple answers, you can print any of them.

Sample Input

Input

2
1 2

Output

PRPLRP

Input

4
0 2 0 2

Output

RPRRPLLPLRRRP

#include<stdio.h>
#define K 1111111
char num[K];

int main(){
	int n,i,t,coin[310],flag,count,temp;
	while(~scanf("%d",&n)){
		t=0;
		count=0;
		for(i=0;i<n;i++){
			scanf("%d",&temp);
			count+=temp;
			coin[i]=temp;
		}
		for(i=0;i<n;){

			if(i==n-1){
				flag=0;
			}
			else if(i==0){
				flag=1;
			}
			if(coin[i]>0){
				coin[i]--;
				num[t]='P';
				t++;
				count--;
				if(count==0){
					break;
				}
			}
			if(flag==1){
				i++;
			}
			else{
				i--;
			}
			if(flag==1){
				num[t]='R';
				t++;
			}
			else{
				num[t]='L';
				t++;
			}
		}
		printf("%s\n",num);
	}
	return 0;
}