问题描述 USACO 2016 US Open Contest, Bronze Problem 1. Diamond Collector https://usaco.org/index.php?page=viewproblem2&cpid=639 给定长度为 N 的数组和 K ，输出 subsequence 最长的长度，要求 subsequence 中任意两数之差不超过 K 。

问题描述 USACO 2016 February Contest, Bronze Problem 1. Milk Pails https://usaco.org/index.php?page=viewproblem2&cpid=615 给定 X, Y, M ，求 aX + bY 不超过 M 的最大值，a, b 任意。 样例 输入 17 25 77 输出 76 思路 a

输入 读入单行 a, b = map(int, input().split()) print(a+b) 读入多行 import sys for line in sys.stdin: list1 = map(int, line.strip().split()) print(sum(list1)) readline() 、readlines() 和 read() 区别

模板 #include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include "algo/debug.h" #else #define debug(...) 42 #endif int main() { ios::sync_with_stdio(false); cin.t

Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub.