hdu 5777 domino(贪心)
来源:互联网 发布:淘宝隐形降权7天恢复 编辑:程序博客网 时间:2024/05/14 10:02
domino
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 179 Accepted Submission(s): 105
Problem Description
Little White plays a game.There are n pieces of dominoes on the table in a row. He can choose a domino which hasn't fall down for at most k times, let it fall to the left or right. When a domino is toppled, it will knock down the erect domino. On the assumption that all of the tiles are fallen in the end, he can set the height of all dominoes, but he wants to minimize the sum of all dominoes height. The height of every domino is an integer and at least 1.
Input
The first line of input is an integer T ( 1≤T≤10 )
There are two lines of each test case.
The first line has two integer n and k, respectively domino number and the number of opportunities.(2≤k,n≤100000 )
The second line has n - 1 integers, the distance of adjacent domino d,1≤d≤100000
There are two lines of each test case.
The first line has two integer n and k, respectively domino number and the number of opportunities.(
The second line has n - 1 integers, the distance of adjacent domino d,
Output
For each testcase, output of a line, the smallest sum of all dominoes height
Sample Input
14 22 3 4
Sample Output
9
Source
BestCoder Round #85
题意:地上有n个多米诺,最多推倒k次,前一个多米诺的高度>=两者距离+1可以推倒后面的,现在问n个多米诺最小高度之和是多少
思路:贪心即可。把前k个最大的路径断掉,其他的高度等于路径+1即可
代码:
#include<cstring>#include <algorithm>#include <math.h>#include <queue>#include <stdio.h>using namespace std;const int N = 100005;int a[N];int cmp(int a,int b){ return a>b;}int main(){ int tcase,n,k; scanf("%d",&tcase); while(tcase--){ scanf("%d%d",&n,&k); long long sum = 0; for(int i=1;i<n;i++){ scanf("%d",&a[i]); sum=sum+a[i]+1; } if(n<=k){ printf("%d\n",n); continue; } sort(a+1,a+n,cmp); for(int i=1;i<k;i++){ sum-=a[i]; } printf("%I64d\n",sum+1); } return 0;}
0 1
- hdu 5777 domino(贪心)
- hdu 5777 domino (贪心)
- HDU 5777 (domino 贪心)
- HDU 5777 domino(贪心)
- 【HDU】5777 - domino(贪心)
- hdu 5777 domino【贪心】
- HDU 5777 domino 贪心
- HDU 5777 domino
- HDU 5777 domino
- HDU-5777 domino
- HDU 5777 domino
- hdu 5777 domino
- HDU 5777 BestCoder Round #85 domino (多米诺骨牌模拟)
- HDU 5777/BC 85B domino
- hdu 5777 贪心
- Hdu 5777多米诺[贪心]
- HDU 5777 贪心
- HDU Saving HDU (贪心)
- Git初步体验(SSH公钥、PUSH、PULL)
- nachos lab2-线程调度
- nachos lab3-线程同步
- TCPCopy
- android学习 页面和跳转
- hdu 5777 domino(贪心)
- 冒泡排序之从小到大排序
- RecyclerView新体验(1)
- maven安装以及eclipse配置maven
- VMware Centos6.5 网络设置
- 理解Hive表(Hive Table)
- windows下PyCharm运行和调试scrapy
- thinkphp怎么修改默认提示信息
- Android小知识总结