- 博客(29)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 nyoj236
心急的C小加时间限制：1000 ms | 内存限制：65535 KB难度：4描述 C小加有一些木棒，它们的长度和质量都已经知道，需要一个机器处理这些木棒，机器开启的时候需要耗费一个单位的时间，如果第i+1个木棒的重量和长度都大于等于第i个处理的木棒，那么将不会耗费时间，否则需要消耗一个单位的时间。因为急着去约会，C小加想在最短的时间内把木棒处理完，你能告诉他应该怎样做吗？
2014-04-30 21:35:57
499
原创 nyoj195&&nyoj201(递增递减dp)
#include #include#include#include#include#include#includeusing namespace std;#define Max(a,b) a>b?a:b#define Min(a,b) a<b?a:bint dp[1005];struct node{ int x,y;}p[1005];bool cmp(nod
2014-04-27 10:08:43
428
原创 nyoj171
#include #include#include#include#include#include#includeusing namespace std;#define Max(a,b) a>b?a:b#define Min(a,b) aint dp[25][25];int main(){ int n,m; cin>>n>>m
2014-04-26 11:29:19
425
转载 nyoj104
#include #define maxn 101int ans[maxn], temp[maxn][maxn];int row(int n, int ans[]){ int i, b=0, sum=-1000000; for(i=0; i<n; i++) { if(b > 0) b += ans[i]; else b = ans[i
2014-04-26 10:19:51
438
原创 poj1050(压缩矩阵)（dp）
To the MaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 39200 Accepted: 20706DescriptionGiven a two-dimensional array of positive and negative integers,
2014-04-20 18:41:29
367
原创 nyoj49(01背包)
#include #include#include#include#include#include#includeusing namespace std;#define Max(a,b) a>b?a:b#define Min(a,b) aint dp[30010],val[110],wei[110];int main(){ int t;
2014-04-16 19:31:30
389
原创 nyoj36(模板)
#include #include#include#include#include#include#includeusing namespace std;char m1[1000],m2[1000];int dp[1000][1000];int main(){ int t; cin>>t; while(t--) { mems
2014-04-15 19:12:09
397
原创 nyoj17
单调递增最长子序列时间限制：3000 ms | 内存限制：65535 KB难度：4描述 求一个字符串的最长递增子序列的长度如：dabdbf最长递增子序列就是abdf，长度为4输入第一行一个整数0随后的n行，每行有一个字符串，该字符串的长度不会超过10000输出输出字符串的最长递增子序列的长度样例输入3aaaababcabklmncdefg样例输出1
2014-04-14 20:12:23
545
原创 hdu1059(多重背包)
InputEach line in the input describes one collection of marbles to be divided. The lines consist of six non-negative integers n1, n2, ..., n6, where ni is the number of marbles of value i. So, the e
2014-04-12 20:42:25
392
原创 hdu3496(二维背包)
Watch The MovieTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 5035 Accepted Submission(s): 1588Problem DescriptionNew semester i
2014-04-12 11:20:10
389
原创 hdu1712
ACboy needs your helpTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3646 Accepted Submission(s): 1892Problem DescriptionACboy ha
2014-04-09 20:11:01
379
原创 hdu1114
Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10149 Accepted Submission(s): 5113Problem DescriptionBefore ACM can do
2014-04-08 21:30:42
826
原创 二维背包（hdu2159)
问题二维费用的背包问题是指：对于每件物品，具有两种不同的费用；选择这件物品必须同时付出这两种代价；对于每种代价都有一个可付出的最大值（背包容量）。问怎样选择物品可以得到最大的价值。设这两种代价分别为代价1和代价2，第i件物品所需的两种代价分别为a[i]和b[i]。两种代价可付出的最大值（两种背包容量）分别为V和U。物品的价值为w[i]。算法费用加了一维，只需状态也加一维即可。设f[i]
2014-04-08 19:26:13
376
原创 hdu2191(多重背包)
悼念512汶川大地震遇难同胞——珍惜现在，感恩生活Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12911 Accepted Submission(s): 5441Problem Description急！灾
2014-04-07 21:38:28
478
原创 hdu1203(01背包)
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14726 Accepted Submission(s): 5767Problem DescriptionSpeakless很早就想
2014-04-07 17:31:51
393
原创 hdu2955(01背包)
RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10016 Accepted Submission(s): 3723Problem DescriptionThe aspiring Roy th
2014-04-07 15:49:13
391
原创 csu1086(超市购物）（分组背包）
1086: 超市购物Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 203 Solved: 84[Submit][Status][Web Board]Description 上次去超市扫荡回来的东西用完了,Staginner又得跑超市一趟，出发前他列了一张购物清单，打算去买K种不同的商品,每种买一件。到了
2014-04-06 17:45:22
642
原创 unique函数
unique()函数式STL容器中的一个去重函数，大家对这个函数有点误区，它是个去重函数但不是将重复的数字删除，而是将他们放到数组后面，返回第一个重复的值得指针地址，该函数需要包含头文件，下面是我做的测设；代码； int a[]={1,3,2,4,2,1,4,6,8,79,8,56,9}; sort(a,a+13); int *t=unique(a,a+13); int
2014-04-02 21:35:19
702
原创 hdu2054
A == B ?Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 57842 Accepted Submission(s): 8895Problem DescriptionGive you two numbers
2014-04-02 19:46:39
567
1
原创 hdu2057(16进制的输入输出)
A + B AgainTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13995 Accepted Submission(s): 6125Problem DescriptionThere must be man
2014-04-02 15:24:53
434
原创 hdu2056
RectanglesTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13374 Accepted Submission(s): 4313Problem DescriptionGiven two rectangl
2014-04-01 17:25:30
595
原创 hdu2058
The sum problemTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14190 Accepted Submission(s): 4259Problem DescriptionGiven a seque
2014-04-01 10:34:02
480
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人