HDU5777 Domino问题解析-CSDN博客

本文链接：https://blog.csdn.net/wawawa___ac/article/details/52079654

hdu5777

domino

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 523 Accepted Submission(s): 269

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

Sample Output

Source

BestCoder Round #85

Recommend

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
const long long INF=0x7fffffffffffffll;
using namespace std;
long long ans;
long long n;
int  a[500001];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        long long sum=0;
        int n,k;
        cin>>n>>k;
        for(int i=1;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
        }
        sort(a+1,a+n);
        
        for(int i=n-1;i>n-k;i--)
        {
            sum-=a[i];
            if(i<0)          //我一开始没有想到这里会出现k〉n的情况，错了20多遍。终于发现是这里可能越界
            {
                break;
            }
        }
        cout<<sum+n<<endl;
    }
    return 0;
}//ac

c++超内存问题

domino