Codeforces Round #378 (Div. 2) C. Epidemic in Monstropolis

C. Epidemic in Monstropolis

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There was an epidemic in Monstropolis and all monsters became sick. To recover, all monsters lined up in queue for an appointment to the only doctor in the city.

Soon, monsters became hungry and began to eat each other.

One monster can eat other monster if its weight is strictly greater than the weight of the monster being eaten, and they stand in the queue next to each other. Monsters eat each other instantly. There are no monsters which are being eaten at the same moment. After the monster A eats the monster B, the weight of the monster A increases by the weight of the eaten monster B. In result of such eating the length of the queue decreases by one, all monsters after the eaten one step forward so that there is no empty places in the queue again. A monster can eat several monsters one after another. Initially there were n monsters in the queue, the i-th of which had weight ai.

For example, if weights are [1, 2, 2, 2, 1, 2] (in order of queue, monsters are numbered from 1 to 6 from left to right) then some of the options are:

1. the first monster can't eat the second monster because a1 = 1 is not greater than a2 = 2;
2. the second monster can't eat the third monster because a2 = 2 is not greater than a3 = 2;
3. the second monster can't eat the fifth monster because they are not neighbors;
4. the second monster can eat the first monster, the queue will be transformed to [3, 2, 2, 1, 2].

After some time, someone said a good joke and all monsters recovered. At that moment there were k (k ≤ n) monsters in the queue, the j-th of which had weight bj. Both sequences (a and b) contain the weights of the monsters in the order from the first to the last.

You are required to provide one of the possible orders of eating monsters which led to the current queue, or to determine that this could not happen. Assume that the doctor didn't make any appointments while monsters were eating each other.

Input

The first line contains single integer n (1 ≤ n ≤ 500) — the number of monsters in the initial queue.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 106) — the initial weights of the monsters.

The third line contains single integer k (1 ≤ k ≤ n) — the number of monsters in the queue after the joke.

The fourth line contains k integers b1, b2, ..., bk (1 ≤ bj ≤ 5·108) — the weights of the monsters after the joke.

Monsters are listed in the order from the beginning of the queue to the end.

Output

In case if no actions could lead to the final queue, print "NO" (without quotes) in the only line.

Otherwise print "YES" (without quotes) in the first line. In the next n - k lines print actions in the chronological order. In each line print x — the index number of the monster in the current queue which eats and, separated by space, the symbol 'L' if the monster which stays the x-th in the queue eats the monster in front of him, or 'R' if the monster which stays the x-th in the queue eats the monster behind him. After each eating the queue is enumerated again.

When one monster eats another the queue decreases. If there are several answers, print any of them.

Examples

input

6
1 2 2 2 1 2
2
5 5

output

YES
2 L
1 R
4 L
3 L

input

5
1 2 3 4 5
1
15

output

YES
5 L
4 L
3 L
2 L

input

5
1 1 1 3 3
3
2 1 6

output

NO

题目大意：

给出一数组a，每次每个整数可以合并掉相邻的比自己小的数，问有没可能经过一系列合并后，得到b数组

思路：

首先对a划分区间，看能否划分k个区间，使区间 i 其分别等于b[i]。

然后在每个区间上，选出最大的一个元素，模拟合并过程。

#include <cstdio>  
#include <string> 
#include <iostream>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <list>
#include <utility>
#include <vector>
using namespace std;

typedef long long LL;
typedef pair<int, int> pii;
typedef pair<int, char> pic;

const int inf = 0x3f3f3f3f;
const int maxn = 500 + 5;
const int maxn2 = 1e6 + 10;
int n, k, a[maxn], b[maxn];
pii range[maxn];
vector<pic> path;

bool Can() {
    int sum = 0, cnt = 1, last = 1;
    for (int i = 1; i <= n; ++i) {
        sum += a[i];
        if (sum > b[cnt]) return false;

        if (sum == b[cnt]) {
            range[cnt].first = last;
            range[cnt].second = i;

            last = i + 1;
            ++cnt;
            sum = 0;
        }
    }
    return cnt == k + 1;
}

bool Merge(int left, int right, int cur, int bi) {
    if (left == right) return true;

    int i = cur - 1, j = cur + 1;
    int sum = a[cur];
    cur = cur - left + bi;

    while (i >= left && j <= right) {
        if (a[i] < a[j]) {
            if (a[i] < sum) {
                path.push_back(pic(cur--, 'L'));
                sum += a[i--];
            } else {
                return false;
            }

        } else {
            if (a[j] < sum) {
                path.push_back(pic(cur, 'R'));
                sum += a[j++];
            } else {
                return false;
            }
        }

    }

    while (i >= left) {
        if (a[i] < sum) {
            path.push_back(pic(cur--, 'L'));
            sum += a[i--];
        } else {
            return false;
        }

    }

    while (j <= right) {
        if (a[j] < sum) {
            path.push_back(pic(cur, 'R'));
            sum += a[j++];
        } else {
            return false;
        }

    }
    return true;
}

bool Solve() {
    if (!Can()) return false;

    for (int i = 1; i <= k; ++i) {
        int maxst = range[i].first;

        for (int j = range[i].first + 1; j <= range[i].second; ++j) {
            if (a[maxst] <= a[j]) {
                if (j < range[i].second) {
                    if (a[j - 1] < a[j] || a[j + 1] < a[j]) maxst = j;
                } else {
                    if (a[j - 1] < a[j]) maxst = j;
                }
            }
        }

        if (!Merge(range[i].first, range[i].second, maxst, i)) return false;
    }
    return true;
}

int main() {
#ifdef NIGHT_13
    freopen("in.txt", "r", stdin);
#endif
    std::ios::sync_with_stdio(false);

    while (scanf("%d", &n) != EOF) {
        path.clear();

        for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
        scanf("%d", &k);
        for (int i = 1; i <= k; ++i) scanf("%d", &b[i]);

        if (!Solve()) {
            printf("NO\n");

        } else {
            printf("YES\n");
            for (int i = 0; i < path.size(); ++i) {
                printf("%d %c\n", path[i].first, path[i].second);
            }

        }
    }
    return 0;
}