USACO-Section1.3 Ski Course Design
2017-06-04 20:06
295 查看
2017-06-04
题目大意:
农民约翰的农场里有N座山峰(1<=N<=1000),每座山都有一个在0到100之间的整数的海拔高度。因为在冬天山上有丰富的积雪,所以约翰经常开办滑雪训练营。 不幸的是,约翰刚刚得知税法在滑雪训练营方面有新变化,明年开始实施。在仔细阅读法律后,他发现如果滑雪训练营的最高和最低的山峰海拔高度差大于17就要收税。因此,如果他改变山峰的高度(使最高与最低的山峰海拔高度差不超过17),就可以避免支付税收。 如果改变一座山x单位的高度成本是x^2单位,约翰最少需要付多少钱?约翰只愿意改变整数单位的高度。
样例输入:
5 20 4 1 24 21
样例输出:
18
题解:
一开始以为,每座山可以减多次,后来发现题目都理解错了。每座山只可以进行一次变换。将高度范围设置在[i,i+17]范围内,枚举i的可能性,在算出每一种i的对应的ans,求出最小的ans。
代码:
#include<iostream> #include<fstream> #include<cstring> #include<algorithm> using namespace std; const int N = 1005; int n; int ans = 0 ,minans = 0x3f3f3f; int height; int h[101]; int main(){ ofstream cout("skidesign.out"); ifstream cin("skidesign.in"); cin >> n; int minH = 0 , maxH = 100; memset(h , 0 , sizeof(h)); for(int i = 0;i < n;i++){ cin >> height; h[height]++; } for(int i = 0;i <= 100;i++){ ans = 0; for(int j = 0;j <= i;j++){ ans += h[j] * (j - i) * (j - i); } for(int j = i + 17;j <= 100;j++){ ans += h[j] * (j - i - 17) * (j - i - 17); } minans = min(ans , minans); } cout << minans << endl; return 0; }
相关文章推荐
- USACO-Section1.3 Ski Course Design
- USACO Section 1.3 Ski Course Design
- USACO-Section 1.3 Ski Course Design
- USACO Section 1.3 Ski Course Design
- USACO - Chapter1 Section 1.3 - Ski Course Design
- USACO section 1.3 Ski Course Design
- USACO-Section1.3 Ski Course Design【暴力枚举】
- USACO Section 1.3 Ski Course Design 解题报告
- USACO-Section 1.3 Ski Course Design(枚举)
- USACO-Section 1.3 Ski Course Design Lock[...]
- USACO-Section1.3 Ski Course Design [模拟]
- USACO Section1.3 Ski Course Design 解题报告
- USACO 1.3 Ski Course Design
- USACO 1.3 Ski Course Design - 暴力
- USACO 1.3 Ski Course Design 转化
- USACO-Section1.4 Ski Course Design (枚举)
- 【USACO 1.3】Ski Course Design
- usaco 1.3 Ski Course Design
- USACO 1.3 Ski Course Design (枚举)
- USACO 1.3 Ski Course Design