USACO 2017 January Contest, Gold Problem 2. Hoof, Paper, Scissors
原题下载 USACO2017-JAN-G2 答案: #include <cstdio> #include <cassert> #include <algorithm> using namespace std; #define NMAX 100000 #define KMAX 20 int moves[NMAX]; int dp[NMAX + 1...
USACO 2017 January Contest, Gold Problem 3. Cow Navigation
原题下载 USACO2017-JAN-G3 答案: import java.io.*; import java.util.*; public class cownav { static int[] dx = new int[]{-1,0,1,0}; static int[] dy = new int[]{0,1,0,-1}; static int n; static char[]...
USACO 2017 January Contest, Platinum Problem 1. Promotion Counting
原题下载 USACO2017-JAN-P1 答案: import java.io.*; import java.util.*; public class promote { static LinkedList<Integer>[] children; static int[] size; static int[] start; public static void m...
USACO 2017 January Contest, Platinum Problem 2. Building a Tall Barn
原题下载 USACO2017-JAN-P2 答案: #include <bits/stdc++.h> using namespace std; typedef long long ll; const int MAXN = 1e5+5; ll n, k, a[MAXN]; ll ct(double x) { ll tot = 0; for (int i = 0; i &...
USACO 2017 January Contest, Platinum Problem 3. Subsequence Reversal
原题下载 USACO2017-JAN-P3 答案: import java.util.Arrays; import java.util.Scanner; public class subrev { public static void main (String[] args) { Scanner in = new Scanner(System.in); int n = in.ne...
USACO 2015 December Contest, Platinum Problem 3. Counting Haybales
原题下载 USACO2015-DEC-P3 答案: (Analysis by Nick Wu) For this problem, we are given a list of NN integers and want to support the following three operations: 1) Compute the minimum number in an in...
USACO 2015 December Contest, Platinum Problem 2. High Card Low Card (Platinum)
原题下载 USACO2015-DEC-P2 答案: (Analysis by Mark Gordon) In the simple case where high card always wins one optimal strategy that Bessie can take is to always answer FJ's plays with her lowest car...
USACO 2015 December Contest, Gold Problem 3. Bessie's Dream
原题下载 USACO2015-DEC-G3 答案: (Analysis by Nathan Pinsker) This is a shortest-path problem where some of the tiles follow special rules. In shortest-path problems (and dynamic programming problem...
USACO 2015 December Contest, Bronze Problem 2. Speeding Ticket
原题下载 USACO2015-DEC-B2 答案: (Analysis by Nick Wu) This problem gives us the speed limit along a 100 mile segment of road and the speed that Bessie traveled through each section. Our job is to f...
