New Year Present
来源:互联网 发布:stc89c51单片机 编辑:程序博客网 时间:2024/06/05 09:07
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 putai 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 most106 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 integersa1, a2, ..., an(0 ≤ ai ≤ 300).
It is guaranteed that at least one ai is positive.
Output
Print the sequence that consists of k(1 ≤ k ≤ 106) 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 exactlyai coins. If there are multiple answers, you can print any of them.
Sample Input
21 2
PRPLRP
40 2 0 2
RPRRPLLPLRRRP
#include<stdio.h>#define K 1111111char 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;}
- B. New Year Present
- New Year Present
- codeforces New Year Present 题解
- B. New Year Present----构造
- codeforces--goodbye2013 --B. New Year Present
- codeforces-379B. New Year Present
- Codeforces 379B New Year Present(模拟)
- Good Bye 2013---B. New Year Present
- new year~~
- new year
- new year
- new year
- new year
- new year
- New Year, New Start
- New Year, New Life
- 2006 New year New hope
- Happy New Year!
- android studio 中文社区
- Super Mobile Charger
- NYOJ 113 字符串替换
- 算法复杂度分析
- 随机数是骗人的,.Net、Java、C为我作证
- New Year Present
- NSURLSession/NSURLConnection HTTP load failed (kCFStreamErrorDomainSSL, -9824) 报错解决办法
- 《Android开发艺术探索》读书笔记--part1 Activity的生命周期和启动模式
- 【基础建模】实例一:碰碰球和茶几、沙发
- LeetCode-20-Valid Parentheses(堆栈)-Easy
- 类的静态成员
- XML
- python numpy教程
- Git服务器的搭建, 以及Android studio 上克隆git 服务器上的项目