- 博客(7)
- 资源 (2)
- 收藏
- 关注
原创 UVa 10034 Freckles
/* Author: ACb0y Date: 2010-5-22 Result: AC Descripition: UVa 10034 Freckles(mst)*/#include #include using namespace std;double INF = 1 << 30;struct point { double x; dou
2010-05-22 10:00:00 714
原创 UVa 10034 Freckles
/* Author: ACb0y Date: 2010-5-22 Result: AC Descripition: UVa 10034 Freckles(mst)*/#include #include using namespace std;double INF = 1 << 30;struct point { double x; dou
2010-05-22 09:58:00 624
原创 UVa 10034 Freckles
/* Author: ACb0y Date: 2010-5-22 Result: AC Descripition: UVa 10034 Freckles(mst)*/#include #include using namespace std;double INF = 1 << 30;struct point { double x; dou
2010-05-22 09:57:00 955
原创 UVa 10003 Cutting Sticks
题目是经典DP,和矩阵相乘的最小乘法次数那个是一样的 f[i,j]=min{f[i,k]+f[k,j]}+j-i (k是i,j之间的木棍切割点) f[0,L]就是答案。由于划分阶段貌似比较困难,于是毫不犹豫的使用记忆化搜索开始的时候f数组开了1000*1000(由于L最大为1000),然后转移状态的时候从把所有的切割点过一遍,复杂度是O(kn^2),k于是提交,居然TLE
2010-05-20 21:14:00 1933
原创 UVa 10131 Is Bigger Smarter?
/* Author: ACboy Date: 2010-5-20 Result: AC Descripition: UVa 10131 Is Bigger Smarter?*/#include #include using namespace std;struct elephant { int w; int iq; int order;}
2010-05-20 19:27:00 1465
原创 UVa 10405 Longest Common Subsequence
/* Author: ACboy Date: 2010-5-19 Result: AC Descripition: UVa 10405 Longest Common Subsequence*/#include using namespace std;char str[2][1100];int d[1100][1100];int get_max(i
2010-05-19 22:08:00 1078
原创 UVa 103 Stacking Boxes
/* Author: ACboy Date: 2010-5-19 Result: AC Descripition: UVa 103 Stacking Boxes*/#include #include using namespace std;//邻接矩阵int g[40][40];//记录每条边int edg[35][15];//dp数组i
2010-05-19 21:11:00 1138
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人