feng_zhiyu的博客

题目链接Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. Ho...

链接：https://www.nowcoder.com/acm/contest/119/F 来源：牛客网Beautiful Land 时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 131072K，其他语言262144K 64bit IO Format: %lld 题目描述 It’s universally acknowledged that there’re i...

链接：https://www.nowcoder.com/acm/contest/91/L 来源：牛客网时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 131072K，其他语言262144K 64bit IO Format: %lld 题目描述 给一个数组 a，长度为 n，若某个子序列中的和为 K 的倍数，那么这个序列被称为“K 序列”。现在要你 对数组 a 求出最长...

时间限制：1.0s 内存限制：256.0MB问题描述 　　观察这个数列： 　　1 3 0 2 -1 1 -2 …　　这个数列中后一项总是比前一项增加2或者减少3。　　栋栋对这种数列很好奇，他想知道长度为 n 和为 s 而且后一项总是比前一项增加a或者减少b的整数数列可能有多少种呢？ 输入格式 　　输入的第一行包含四个整数 n s a b，含义如前面说述。 输出格式 　　...

Bessie has gone to the mall’s jewelry store and spies a charm bracelet. Of course, she’d like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm i in the s

Windarik is a happy man who seeks only happiness in his life. Even when he’s working, he consciously chooses tasks which make him happy. There are N agencies, and each agency offers zero or more task

http://poj.org/problem?id=2392#include#include#includeusing namespace std;const int N=40005;int dp[N+1];struct blocks {    int h,a,num;    bool operator         return this->a