HDU 5777 domino
来源:互联网 发布:老馆艳后 知乎 编辑:程序博客网 时间:2024/06/08 17:08
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
Output
For each testcase, output of a line, the smallest sum of all dominoes height
Sample Input
1
4 2
2 3 4
Sample Output
9
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
Output
For each testcase, output of a line, the smallest sum of all dominoes height
Sample Input
1
4 2
2 3 4
Sample Output
9
#include<stdio.h>#include<string.h>#include<math.h>#include<iostream>#include<algorithm>#include<climits>#include<stack>#include<queue>#include<map>#include<vector>using namespace std;#define ll long longconst int N=100002;const int M=5005;int d[N];int main(){ int t,n,k,i,j; scanf("%d",&t); while (t--) { scanf("%d%d",&n,&k); ll sum=n; for (i=1;i<n;i++) scanf("%d",&d[i]); sort(d+1,d+n); for (i=1;i+k-1<n;i++) sum+=d[i]; printf("%lld\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/BC 85B domino
- HDU 5777 BestCoder Round #85 domino (多米诺骨牌模拟)
- hdu 5777 domino(BestCoder Round #85——思维题)
- HDU 4210Su-domino-ku
- HDOJ 5777 domino
- 【杭电】[5777]domino
- Ubuntu16.04lts 安装Theano配置GPU
- UVALive 6618 Skycity(数学)
- 在MYSQL中使用全文索引(FULLTEXTindex)MYSQL的一个很有用的特性是使用全文索引
- 后缀数组入门 SPOJ694
- Java实现一个GUI的SEO软文生成器v1
- HDU 5777 domino
- Object函数说明
- Python 03:Python字符串
- JQuery实现密码有短暂的显示过程和实现...
- Mysql 建表用 MyISAM不用InnoDB(大数据高读取)
- CSS-轮廓(outline)
- Loop(38)
- Java对象初始化
- 顺心随笔NO.1