USACO 2016 December Contest, Platinum Problem 3. Robotic Cow Herd
原题下载 USACO2016DEC-G3 答案: #include <iostream> #include <vector> #include <algorithm> using namespace std; int N, M; vector<int> A[100010]; int F[100010]; int totalcount...
USACO 2015 December Contest, Gold Problem 2. Fruit Feast
原题下载 USACO2015-DEC-G2 答案 (Analysis by Nathan Pinsker) This is a standard knapsack problem with a bit of a twist. After Bessie drinks water once, her fullness value will decrease, but she won'...
USACO 2015 December Contest, Platinum Problem 1. Max Flow
原题下载 USACO2015-DEC-P1 答案 (Analysis by Nick Wu) In this problem, we're given a set of paths on a tree and want to compute the maximum number of paths some node in the tree is on. The naive sol...
USACO 2015 December Contest, Gold Problem 1. High Card Low Card (Gold)
原题下载 USACO2015-DEC-G1 答案 (Analysis by Nathan Pinsker) This problem seems daunting at first, but a few insights can give way to a greedy strategy for solving it: - You're free to mentally rear...
USACO 2015 December Contest, Silver Problem 3. Breed Counting
原题下载 USACO2015-DEC-S3 答案 (Analysis by Nick Wu) In this problem, we have a list of N integers, each either being 1, 2, or 3. For a list of certain intervals, we want to count how many numbers ...
USACO 2015 December Contest, Silver Problem 2. High Card Wins
原题下载 USACO2015-DEC-S2 答案 (Analysis by Nick Wu) In this problem, Bessie and Elsie each have NN unique integers ranging from 1 to 2N2N. Over NN rounds, Bessie and Elsie will each select a diffe...
USACO 2015 December Contest, Bronze Problem 3. Contaminated Milk
原题下载 USACO2015-DEC-B3 答案 (Analysis by Nick Wu) In this problem we're given a list of the types of milk that each guest drank, when they drank each type, and when/if they got sick. Using this ...
USACO 2015 December Contest, Bronze Problem 1. Fence Painting
原题下载 USACO2015-DEC-B1 答案 (Analysis by Nick Wu) In this problem, we have a fence and two sections of the fence have been painted. We need to determine how much of the fence has been painted. W...
USACO 2016 January Contest, Gold Problem 1. Angry Cows
原题下载 USACO2016-JAN-G1 答案 (Analysis by Brian Dean) One approach for solving this problem is by combining a left-to-right scan with a right-to-left scan (one could call each scan either greedy ...
