原题下载： USACO2016-OPEN-S3 答案： #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long l...
原题下载 USACO2017-OPEN-P3 答案: #include <iostream> #include <vector> #include <map> #include <string> #include <cassert> #include <deque> #include <memory&g...
原题下载： USACO2016-OPEN-S2 答案： import java.io.*; import java.util.*; public class diamondS { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(...
原题下载： USACO2016-OPEN-S1 答案： #include #include #include #define NMAX 100000 int n; long long x[NMAX]; long long y[NMAX]; #define infinite 1000000000 struct Analysis { long long area; std::ve...
原题下载： USACO2016-OPEN-B3 答案： import java.io.*; import java.util.*; public class reduceB { // x1 and x2 are the smallest x-coordinates seen // x3 and x4 are the largest x-coordinates seen sta...
原题下载： USACO2016-OPEN-B1 答案： (Analysis by Nick Wu) Imagine that we have already selected the smallest diamond that will be shown. We can then count exactly how many diamonds are no smaller t...
原题下载： USACO2016-OPEN-B2 答案： import java.io.*; import java.util.*; public class bcsB { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new ...
原题下载： USACO2017-OPEN-P-2 答案： by Nathan Pinsker First, consider any path between two vertices of different colors. There must exist an edge on this path whose endpoints are different colors ...
原题下载 USACO2017-OPEN-P-1 答案 by Nathan Pinsker Intuitively, the larger our rectangles are, the more likely they are to overlap other rectangles. Since we want to maximize the number of rectangl...
