Saving HDU
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2834 Accepted Submission(s): 12
原创
2012-05-24 22:40:34
359阅读
xxx定律
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 750 Accepted Submission(s): 621
P
原创
2012-05-25 01:47:35
429阅读
题目大意：输入背包容量、宝物种类、每种宝物的单价和体积。输出背包所能装下的宝物的最大价值。注意宝物可以拆分，这是这道题与传统的背板问题的不同。解题思路：1)先排序。按价值从大到小来取。2)宝物时都需要拆分才能放进背包取决于宝物的体积是否小于背包当前的剩余容量。如果小于，则不需要拆分即，V -= ns[i].num;。否则需要拆分,即sum += ns[i].weight*V;
原创
2013-08-14 17:43:17
10阅读
<span style="color:#6600cc;">/* J - Saving HDU Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 2111 De
转载
2017-07-04 10:58:00
19阅读
2评论
public int kIncreasing(int[] arr, int k) {
int ans = 0;
int n = arr.length;
for (int i = 0; i < k; i++) {
int maxLen = 0;
List<Integer> list = new ArrayList<>
寻找大富翁
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1164 Accepted Submission(s): 597
原创
2012-05-25 01:50:48
374阅读
Saving HDUTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6453Accepted Submission(s): 2973Problem ...
转载
2015-06-02 13:47:00
88阅读
2评论
Saving HDUTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s)
原创
2022-12-02 00:31:12
106阅读
本来想着运用动态规划 不过这一题直接排序貌...
转载
2016-03-23 21:39:00
43阅读
本来想着运用动态规划 不过这一题直接排序貌...
转载
2016-03-23 21:39:00
44阅读
Problem DescriptionNow you are given one non-negative integer n in 10-base notation, it will only contain digits ('0'-'9'). You are allowed to choose 2 integers i and j, such that: i!=j, 1≤i#include int main(){ int n,i,j,len,l,MIN,flag,ss; char str[1005],min_c,t; scanf("%d"
转载
2013-08-07 19:32:00
18阅读
2评论
Description Now you are given one non-negative integer n in 10-base notation, it will only contain digits ('0'-'9'). You are allowed to choose 2 integers i and j, such that: i!=j, 1≤i<j≤|n|, here
原创
2022-11-09 19:32:56
96阅读
Who's in the Middle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4519 Accepted Submissi
原创
2012-05-24 19:58:01
640阅读
Min NumberDescriptionNow you are given one non-negative integer n in 10-base notation, it will only contain digits ('0'-'9'). You are allowed to choose 2 integers i and j, such that: i!=j, 1≤i 2 # include 3 int main() 4 { 5 int T,n,i,j,k; 6 char s[10010]; 7 char temp; 8 int max,min;
转载
2013-04-07 22:39:00
59阅读
2评论
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2111 题意：中文题（输入可
原创
2022-11-23 10:13:15
30阅读
Saving HDU
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d
& %元老也只剩下XHD夫妇二人了。显然，作为多年拼搏的商人，
原创
2022-08-24 11:36:27
61阅读
Description 称一个1,2,...,N的排列P1,P2...,Pn是Magic的，当且仅当2<=i<=N时，Pi>Pi/2. 计算1，2，...N的排列中有多少是Magic的，答案可能很大，只能输出模P以后的值 称一个1,2,...,N的排列P1,P2...,Pn是Magic的，当且仅当2
转载
2017-04-06 22:21:00
36阅读
2评论
Saving
原创
2022-08-30 15:37:24
17阅读
http://acm.fzu.edu.cn/problem.php?pid=2111/*0ms,232KB*/#include#include#includeusing namespace std;const int mx = 1005;char s[mx];deque pos[10];int main(){ int t, n, m, i, maxpos, m
原创
2023-04-12 06:42:40
46阅读
