二分答案 [Usaco2014 Mar]Sabotage

关注

VIP免费原创最新推荐文章于 2026-04-03 10:00:00 发布 760 阅读 AI 写同款· GEO 优化 ›

USACO自学笔记：二分查找二分查找原理：对于一个有序数组，在其中查一个元素。首先检查该数组中间元素，如果大于目标元素，截该数组前半段再次查找，如小于目标元素，截数组后半段再次查找。重复该方法直到找到该元素或者在搜索区域缩小到1时还未找到。示例代码： public class BinarySearch { public static int binarySearch (int[] original, int target) { int start = 0; int end = original.length - 1; 阅读详情

问题 L: [Usaco2014 Mar]Sabotage
时间限制: 1 Sec 内存限制: 128 MB
题目描述
Farmer John”s arch-nemesis, Farmer Paul, has decided to sabotage Farmer John”s milking equipment! The milking equipment consists of a row of N (3 <= N <= 100,000) milking machines, where the ith machine produces M_i units of milk (1 <= M_i <= 10,000). Farmer Paul plans to disconnect a contiguous block of these machines – from the ith machine up to the jth machine (2 <= i <= j <= N-1); note that Farmer Paul does not want to disconnect either the first or the last machine, since this will make his plot too easy to discover. Farmer Paul”s goal is to minimize the average milk production of the remaining machines. Farmer Paul plans to remove at least 1 cow, even if it would be better for him to avoid sabotage entirely. Fortunately, Farmer John has learned of Farmer Paul”s evil plot, and he is wondering how bad his milk production will suffer if the plot succeeds. Please help Farmer John figure