oj1025
摘要：方案：二分查找+动态规划 Problem Description JGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.Ha
阅读全文
posted @
2017-03-25 10:01
郑哲
阅读(218)
推荐(0) 编辑
杭电oj1024 Max Sum Plus Plus
摘要：Problem Description Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more diffi
阅读全文
posted @
2017-03-15 16:20
郑哲
阅读(409)
推荐(0) 编辑
zju1196-Fast Food
摘要：1 #include 2 using namespace std; 3 4 5 int i, j, m; 6 int *d;//沿高速公路n个快餐店的位置 7 int n, k;//饭店的数量，仓库的数量 8 int cost[202][202]; 9 int dis[205][205]; 10 int temp; 11 12 13 void madecost(...
阅读全文
posted @
2017-03-15 16:19
郑哲
阅读(189)
推荐(0) 编辑
ZJU1183-Scheduling Lectures
摘要：1 #include 2 using namespace std; 3 4 int n; //主题的数量 5 int L, C; //每节课的时间，常量C 6 int *time; //每个主题需要的时间 7 int *minLec; //主题1~i（1=0; j--) 32 { 33 sum += time[j ...
阅读全文
posted @
2017-03-15 15:35
郑哲
阅读(153)
推荐(0) 编辑
