[Java] Ski Course Design

最新推荐文章于 2021-02-19 05:39:01 发布

lincs_

最新推荐文章于 2021-02-19 05:39:01 发布

阅读量160

点赞数 1

分类专栏： USACO

本文链接：https://blog.csdn.net/weixin_41714373/article/details/112250968

版权

USACO 专栏收录该内容

30 篇文章

订阅专栏

本文介绍了一个用于计算滑雪场建设成本最小化的算法。通过读取不同山丘的高度，并遍历所有可能的区间组合来确定最低成本。该算法使用Java实现，并从文件中读取数据，最终将结果输出到指定文件。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

/* Use the slash-star style comments or the system won't see your
   identification information */
/*
ID: lincans1
LANG: JAVA
TASK: skidesign
*/
import java.io.*;
import java.util.*;

public class skidesign {

	public skidesign() throws IOException {
		// Use BufferedReader rather than RandomAccessFile; it's much faster
		BufferedReader f = new BufferedReader(new FileReader("skidesign.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("skidesign.out")));

		int N = Integer.parseInt(f.readLine());
		int[] hills = new int[N];
		for (int i = 0; i < N; i++) {
			hills[i] = Integer.parseInt(f.readLine());
		}

		// search every interval [0, 17] [1, 18] ... [83, 100]
		int ans = Integer.MAX_VALUE;
		for (int left = 0, right = 17; right <= 100; left++, right++) {
			int temp_ans = 0;
			for (int hill : hills) {
				if (hill < left) {
					temp_ans += (left - hill) * (left - hill);
				}
				if (hill > right) { 
					temp_ans += (hill - right) * (hill - right);
				}
			}
			ans = Math.min(ans, temp_ans);
		}
		out.println(ans);
	    out.close();
	}
	
	public static void main (String [] args) throws IOException {
		new skidesign();
	}
}