Codeforces Round #236 (Div. 2)B
来源:互联网 发布:修理图片的软件 编辑:程序博客网 时间:2024/04/30 22:27
B. Trees in a Row
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 ai 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),ai + 1 - ai = 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?
The first line contains two space-separated integers: n, k (1 ≤ n, k ≤ 1000). The second line contains n space-separated integersa1, a2, ..., an (1 ≤ ai ≤ 1000) — the heights of the trees in the row.
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.
4 11 2 1 5
2+ 3 2- 4 1
4 11 2 3 4
0
#include <cstdio>#define MAX 1001int k,n,hight[MAX];int main(){ //freopen("input.txt","r",stdin); while(scanf("%d %d",&n,&k)!=EOF) { for(int i=1;i<=n;i++)scanf("%d",hight+i); int min=1001,temp=0; for(int i=1;i<=1000;i++) { int d=0; for(int j=1;j<=n;j++) { if((i+(j-1)*k)!=hight[j])d++; } if(d<min) { min=d; temp=i; } } printf("%d\n",min); for(int i=1;i<=n;i++) { int f=temp+(i-1)*k-hight[i]; if(f<0)printf("- %d %d\n",i,-f); if(f>0)printf("+ %d %d\n",i,f); } } return 0;}
- Codeforces Round #236 (Div. 2)B
- Codeforces round #236Div.2--A;B
- Codeforces Round #236 (Div. 2)------A,B
- codeforces round #236 div.2 B
- Codeforces Round #236 (Div. 2) B. Trees in a Row
- codeforces Round # 236(DIV 2)B. Trees in a Row
- Codeforces Round #236 (Div. 2) B. Trees in a Row
- Codeforces Round #131 (Div. 2) A B
- Codeforces Round #134 (Div. 2)B. Airport
- Codeforces Round #170 (Div. 2) problem B
- Codeforces Round #173 (Div. 2) Problem B
- Codeforces Round #181 (Div. 2) B. Coach
- Codeforces Round #185 (Div. 2)--A,B
- Codeforces Round #171 (Div. 2) B
- Codeforces Round #169 (Div. 2) B题
- Codeforces Round #188 (Div. 2) B题
- Codeforces Round #192 (Div. 2) B
- Codeforces Round #203 (Div. 2) B. Resort
- Codeforces Round #236 (Div. 2) B. Trees in a Row
- .NET:一个非常好用的SQL数据库处理类
- Nuts
- codeforces Round #236(DIV 2)A. Nuts(数学类计算题)
- UVa 400 Unix的ls命令
- Codeforces Round #236 (Div. 2)B
- 对于机器人,电脑与有机体生命之间的进化比较(好几年前自己写的,很有感触)
- java删除文件(单个文件,文件夹,子文件夹) 20090812(jsp+servlet+access)
- Linux下重要日志文件及查看方式
- 2012蓝桥杯预赛题-夺冠概率
- 002_021 Python 动态改变Python的搜索路径
- codeforces Round # 236(DIV 2)B. Trees in a Row
- Codeforces Round #236 (Div. 2)A
- Spring MVC中各个filter的用法