摘要:
0-1背包之一n个重量价值分别为wi,vi的物品。从这些物品中挑选出总重量不超过W的物品,求价值总和的最大值。限制条件{n(1,100)、wi,vi(1,100)、W(1,1000)}枚举+dfs:#include#includeusing namespace std... 阅读全文
摘要:
给定连个字符串s1s2... ...sn和t1t2... ...tn。求出这两个字符串最长的公共子序列的长度。字符串s1s2... ...sn的子序列可以表示为si1si2... ...sim(i1using namespace std;const int MAXN=... 阅读全文
摘要:
D. Bear and Tower of Cubestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak ... 阅读全文
摘要:
Fence RepairTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 60866 Accepted: 20067DescriptionFarmer John wants ... 阅读全文
摘要:
Naive OperationsTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 502768/502768 K (Java/Others)Total Submission(s): 2623 Acce... 阅读全文
摘要:
Saruman's ArmyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13974 Accepted: 7011DescriptionSaruman the White... 阅读全文
摘要:
Best Cow LineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 32184 Accepted: 8533DescriptionFJ is about to tak... 阅读全文
摘要:
RMQ(Range Minimum/Maximum Query),即区间最值查询,是指这样一个问题:对于长度为n的数列A,回答若干次询问RMQ(i,j),返回数列A中下标在区间[i,j]中的最小/大值。本文介绍一种比较高效的ST算法解决这个问题。ST(Sparse T... 阅读全文
摘要:
题目描述:链接:https://www.nowcoder.com/acm/contest/141/H来源:牛客网 时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Format: %lld题目描述E... 阅读全文
摘要:
题目描述:链接:https://www.nowcoder.com/acm/contest/140/A来源:牛客网时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 131072K,其他语言262144K64bit IO Format: %lld题目描述Whi... 阅读全文