Algorithm
文章平均质量分 69
tlight
这个作者很懒,什么都没留下…
展开
-
POJ 3125 (Queue)
#include #include #include #include using namespace std;struct job{ int priority; int index;};bool cmp(int l, int r){ return l > r;}int printer(){ //freopen原创 2014-05-12 15:10:26 · 649 阅读 · 0 评论 -
trees in a row
The Queen of England has n trees growing in a row in her garden. At that, thei-th (1 ≤ i ≤ n) tree from the left has heightai meters. Today the Queen decided to update the scenery of her garden. S原创 2014-05-12 17:33:31 · 631 阅读 · 0 评论 -
算法区间DP- 机器人关灯
题意:在X轴上有N个灯泡,[输入] 第一行是case数,每个case,第一个是灯泡的数量N (1输入:22 5374 10191119Output844/**/#include #include #define MAX_N 1005#define INF 0x7FFFFFFFint原创 2016-05-24 20:17:11 · 794 阅读 · 0 评论 -
算法练习:多米诺骨牌
/*有两种多米诺骨牌,1种2X1,另一种2X2,请问N个多米若骨牌放到2×N的框子里有多少中组合1->12->33->54->11f(n)=f(n-1)+2Xf(n-2)f(0)=f(1)=1*/输入:5111000040000200004000020000399995000039999输出:062原创 2016-05-20 16:13:38 · 4379 阅读 · 0 评论 -
DP算法- 循环取石子
//// 有N堆(N//// 状态转移方程dp[i][j] = min(dp[i][k]+[(i+k+1)%n][j-k-1]+sum[i][j])// 把要合并的j堆分成前k堆和后j-k-1堆以及最后一堆i+j//input://3//4//4 5 9 4//6//3 4 6 5 4 2//10//9 3 2 8 5 10 3 13 2 4原创 2016-06-26 15:46:56 · 481 阅读 · 0 评论 -
HDU 4826-Labyrinth-DP
原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=4826/******************************************************************************* Author: Tlight* URL: http://blog.csdn.net/tlight* Title : L原创 2016-06-11 09:21:37 · 393 阅读 · 0 评论 -
DP 练习 uva103 Stacking Boxs
题目链接https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=39#include #define MAX_K 31#define MAX_N 11int k; // number of box, k<=30int n; //原创 2016-06-30 21:12:56 · 399 阅读 · 0 评论 -
hdu1025 - LIS
// LIS// O(nlogn)#include #define MAX_N 500005int n; // number of roads plan to buildint road[MAX_N]; // road[p]=r, means a road from city p to city r, city start from 1int dp[MAX_N]; // dp原创 2016-06-17 23:47:38 · 310 阅读 · 0 评论