CF---B. Trees in a Row

B. Trees in a Row

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Sample test(s)

Input

4 1

1 2 1 5

Output

2

+ 3 2

- 4 1

Input

4 1

1 2 3 4

Output

0


//题目大意： 构造一个等差数列，我这里采用的是一遍遍历，维护一个vis数组标志是否当前访问过和一个最大值max和起始位start！(代表从start开始进行的等差数列最长，即需要改变数值的最短。)
//提供一个易错数据：(题目中表明不能将树减为 负值 ！)---因为这个WA了一发。
/*
5
1 2 1 2 3
答案应该是：
2
+ 3 2
+ 4 2
+ 5 2
*/

代码：

#include <stdio.h>
#include <math.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int N=1010;
int f[N],vis[N];
int main()
{
    
    int i,j,k;int n,num,t;
    while(scanf("%d %d",&n,&k)!=EOF){
        memset(vis,0,sizeof(vis));
        memset(f,0,sizeof(f));
        int max=-1,start=1;int a;
        for(i=1;i<=n;i++) scanf("%d",&f[i]);
        for(i=1;i<=n;i++){
            num=0;
            if(vis[i]==0){
                t=f[i];//这里计算向后的即可；
                for(j=i;j<=n;j++){
                    if(t==f[j]){
                        vis[j]=1;num++;
                    }
                    t=t+k;
                }
                if(num>max){
                    a=f[i]-(i-1)*k;
                    if(a>0){
                        max=num;start=i;
                    }
                }
            }
        }
        //printf("%d %d\n",start,max);
        //记录下了从哪一位开始是需要改变最少的。 start
        //计算一下第一位应该为多少。
        a=f[start]-(start-1)*k;//首位大小应该为a
        printf("%d\n",n-max);
        for(i=1;i<=n;i++){
            if(f[i]==a) ;
            else if(f[i]>a){
                printf("- %d %d\n",i,f[i]-a);
            }
            else{
                printf("+ %d %d\n",i,a-f[i]);
            }
            a=a+k;
        }
    }
    return 0;
}