USACO 2017 January Contest, Silver Problem 1. Cow Dance Show

原题下载

USACO2017-JAN-S1

答案:

import java.io.*;
import java.util.*;
public class cowdance {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new FileReader("cowdance.in"));
PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("cowdance.out")));
StringTokenizer st = new StringTokenizer(br.readLine());
int n = Integer.parseInt(st.nextToken());
int maxT = Integer.parseInt(st.nextToken());
int[] l = new int[n];
for(int i = 0; i < n; i++) {
l[i] = Integer.parseInt(br.readLine());
}
int min = 1;
int max = n;
while(min != max) {
int mid = (min+max)/2;
if(possible(l, mid, maxT)) {
max = mid;
}
else {
min = mid+1;
}
}
pw.println(min);
pw.close();
}

public static boolean possible(int[] l, int k, int t) {
int lastTime = 0;
PriorityQueue<Integer> q = new PriorityQueue<Integer>();
for(int i = 0; i < l.length; i++) {
if(q.size() == k) {
lastTime = q.poll();
}
if(lastTime + l[i] > t) {
return false;
}
q.add(lastTime + l[i]);
}
return true;
}

}

翰林USACO课程体系流程图