CodeForces - 402B Trees in a Row

这道题对我来说不算是个水题，但大佬们都把它看作水题，，

题意是，一共有n根树，一个树匠想要将其修剪到符合等差数列的样子，差值为k，每修剪一棵树需要花一分钟，让你设计一个花费时间最少的方案。

思路：在这些树中寻找最长的、符合该等差数列的树序列（序列中的树可能不挨着），序列外树木的个数即为方案花费的时间。

The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height a_i meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), a_i + 1 - a_i = k, where k is the number the Queen chose.

Unfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?

Input

The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 1000) — the heights of the trees in the row.

Output

In the first line print a single integer p — the minimum number of minutes the gardener needs. In the next p lines print the description of his actions.

If the gardener needs to increase the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, then print in the corresponding line "+ j x". If the gardener needs to decrease the height of the j-th (1 ≤ j ≤ n) tree from the left by x (x ≥ 1) meters, print on the corresponding line "- j x".

If there are multiple ways to make a row of trees beautiful in the minimum number of actions, you are allowed to print any of them.

Example

Input

4 1
1 2 1 5

Output

2
+ 3 2
- 4 1

Input

4 1
1 2 3 4

Output

0

贴代码：

#include <iostream>
#include <algorithm>
#include <cstdio>
const int Maxnum = 1005;
using namespace std;

int main()
{
    int n, k, mid, first, times = 0;
    int list1[Maxnum];
    cin >> n >> k;
    for(int i = 0; i < n; i++)
    {
        cin >> list1[i];
    }
    int pos = 0, key = 0;
    for(int i = 0; i < n; i++)
    {
        times = 0;
        if(list1[i] - i * k <= 0) continue;
        for(int j = i; j >= 0; j--)
        {
            if(j == i){first = list1[j];}
            else
            {
                first -= k;
                if(list1[j] == first)
                {
                    times++;
                }
            }
        }
        for(int j = i; j < n; j++)
        {
            if(j == i) {first = list1[j];}
            else
            {
                first += k;
                if(list1[j] == first)
                {
                    times++;
                }
            }
        }
        if(times > key)
        {
            key = times;
            pos = i;
        }
    }
    cout << n - (key + 1) << endl;
    if(n - (key + 1))
    {
        for(int i = 0; i < n; i++)
        {
            int flag = list1[pos] - k * (pos - i);
            if(list1[i] < flag)
            {
                cout << "+ " << i + 1 << " " << flag - list1[i] << endl;
            }
            else if(list1[i] > flag)
            {
                cout << "- " << i + 1 << " " << list1[i] - flag << endl;
            }
        }
    }
    return 0;
}