【HDU】5777 - domino(贪心)
来源:互联网 发布:满岛光 知乎 编辑:程序博客网 时间:2024/05/29 03:51
点击打开题目
domino
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 688 Accepted Submission(s): 353
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
多找几组例子试一下就发现了结果,就是贪心思想让最远的牌单独推。
代码如下:
#include <cstdio>#include <cstring>#include <algorithm>#include <queue>using namespace std;#define INF 0x3f3f3f3f#define CLR(a,b) memset(a,b,sizeof(a))int main(){ int n,k; int u; int num[100000+11]; __int64 sum; scanf ("%d",&u); while (u--) { scanf ("%d %d",&n,&k); sum = 0; for (int i = 1 ; i < n ; i++) { scanf ("%d",&num[i]); sum += num[i]; } if (k >= n) { printf ("%d\n",n); continue; } sort (num+1,num+n); for (int i = n - 1 , j = 1 ; j < k ; i-- , j++) sum -= num[i]; sum += n; printf ("%I64d\n",sum); } return 0;}
0 0
- 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 (贪心)
- 形态学边界提取
- 如何合理创建mysql数据库
- JSP介绍
- svn 总结
- linux setup flashplayer
- 【HDU】5777 - domino(贪心)
- Github 简明教程
- Python+MySQL用户加密存储验证系统(进阶)
- python中的*args和**kwargs详解
- java旅行第二站---javaSE第一天--奇数乘法表与坐电梯
- Q18:数的子结构
- 使用POSIX Threads进行多线程编程(一)——pthread基本知识
- react native
- Day3、C语言数据类型、变量的输入与输出、进制的转换