- 博客(19)
- 收藏
- 关注
原创 寒冰王座(dp) 完全背包
#include#include#include#define maxn 10005using namespace std;int sum;int dp[maxn];void completepack(int cost,int value){ for(int i=cost;i dp[i]=dp[i]>(dp[i-cost]+val
2014-05-15 22:40:03 519
原创 dp (0,1背包)Bone Collector HDOJ-2602 (基本01背包)
http://acm.hdu.edu.cn/showproblem.php?pid=2602
2014-05-15 22:28:37 363
原创 并查集 球
1006: 球Time Limit: 1 Sec Memory Limit: 128 MB[Submit][Status][Web Board]Problem Description Icy is a lonely boy. He was so boring these days. So he started to play a game himself. Fir
2014-04-27 19:45:21 407
原创 最短路(Dijstra) A strange lift
#include#include#define maxn 300#define INF 0x3f3f3f3fint Edge[maxn][maxn],vis[maxn],Dis[maxn];int n,a,b;void Dijstra(){ int i,now,j,mi; memset(vis,0,sizeof vis); memset(Dis,
2014-04-26 01:31:25 435
原创 最短路(Dijstra) 畅通工程续
畅通工程续 Time Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 112 Accepted Submission(s) : 42Font: Times New Roman | Verdana | GeorgiaFont Siz
2014-04-26 01:23:00 417
原创 最短路(Dijstra) 一个人的旅行
一个人的旅行 Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 165 Accepted Submission(s) : 50Font: Times New Roman | Verdana | GeorgiaFont Si
2014-04-26 01:17:14 474
原创 最短路 (Dijstra) 最短路
#include #pragma comment (linker,"/STACK:102400000,102400000")#define maxn 105#define MAXN 100005#define INF 0x3f3f3f3f#define pi acos(-1.0)#define eps 1e-6using namespace std;int n,
2014-04-26 01:09:16 464
原创 最短路(floyd) Cow Contest
#include#include#define maxn 105#define INF 0x3f3f3f3fint VS[maxn][maxn];int n,m;void floyd(){ int i,j,k; for(k=1;k for(i=1;i for(j=1;j {
2014-04-26 01:02:28 440
原创 最短路(floyd) Cow Hurdles
#include#include#include#define maxn 305#define INF 0x3f3f3f3fint n,m,t;int Edge[maxn][maxn];int max(int a,int b){ return a>b?a:b;}void floyd(){ for ( int k= 1; k
2014-04-26 00:52:51 381
原创 最短路(Bellman_ford) Currency Exchange
#include#include#include#define maxn 1000#define INF 0x3f3f3f3f#define eps 1e-6int n,m,s;double v;int U[2*maxn],V[2*maxn];double R[2*maxn],C[2*maxn],Sum[2*maxn];int Bellman_ford()
2014-04-26 00:39:17 386
原创 最短路 (Dijstra) Til the Cows Come Home
#include#include#define maxn 1005#define INF 0x3f3f3f3fint Dis[maxn],vis[maxn],Edge[maxn][maxn];int t,n;void Dijstra(){ int i,j,now,mi; memset(Dis,0x3f,sizeof Dis); memset
2014-04-26 00:27:10 752
原创 最短路(Dijstra+矩阵转置) Silver Cow Party
#include#include#define maxn 1005#define INF 0x3f3f3f3fint Edge[maxn][maxn],Dis[maxn],vis[maxn],Dis2[maxn];int n,m,x;void Dijstra( ){int i,j,k,mi;memset(vis,0,sizeof vis);memset(Dis,0x3f,sizeof Dis);D
2014-04-26 00:19:41 545
原创 C++ STL泛型总结(一)——vector
一 总大纲C++ STL组件:容器,迭代器,和算法 容器:顺序容器 (vector ,list ,deque,string) 关联容器(set multiset map multimap) 迭代容器:遍历容器 算法:排序,不可变序,变序性算法,数值算法.c++STL泛型编程示例
2014-04-11 21:18:43 1279
原创 STL泛型编程(2)——string
string基本字符系列容器使用string容器,需要#include1.创建string对象 #include#includeusing namespace std;int main(int agrc,char* agrv[]){ string s; cout return 0;}结果:0原因:s是一个空字符串2.给str
2014-04-11 21:18:12 609
原创 第三周—二分法4 已知面积,求最大体积
Problem D Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 142 Accepted Submission(s) : 45Problem DescriptionIn recent days, people
2014-03-13 23:21:43 847
原创 第三周练习题目—二分法 影子的最大长度
Problem A Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 137 Accepted Submission(s) : 48Problem DescriptionCompared to wildleopard's we
2014-03-13 17:14:41 623
原创 第三周练习——二分法2 方程求解
Problem B Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 95 Accepted Submission(s) : 37Problem DescriptionNow,given the equation 8*x^4
2014-03-12 23:01:09 379
原创 第三周练习题目——二分法1 水的高度
Problem G Time Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 98 Accepted Submission(s) : 27Problem DescriptionThe WHU ACM Team has a big cu
2014-03-12 22:37:48 476
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人