05 2019 档案

POJ 1276 完全背包
摘要：Sample Input Sample Output #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int cash, n; int c[15],w[15]; int dp[100005]; v 阅读全文
posted @ 2019-05-28 18:26 kongbb 阅读(434) 评论(0) 推荐(0)
POJ 2063 完全背包
摘要：Sample Input Sample Output 14050 #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int maxn = 5e4+5; int w[15],v[15]; 阅读全文
posted @ 2019-05-28 16:28 kongbb 阅读(196) 评论(0) 推荐(0)
Bone Collector II HDU - 2639
摘要：The title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have seem this title.If you haven't 阅读全文
posted @ 2019-05-26 21:23 kongbb 阅读(142) 评论(0) 推荐(0)
山理校赛 E 九连环
摘要：Problem Description 不知道大家有没有玩过一个叫做 九连环 的玩具，如下图所示。 如果你不了解九连环，那玄黄就带你领略九连环的奥妙： 九连环是我国传统的民间智力玩具，玩具上面有九个连环套在杆上，目标就是通过一定的方式将九个连环从杆上全部取下来。 玩法是这样的： 1、对每个环，有2种 阅读全文
posted @ 2019-05-26 21:19 kongbb 阅读(186) 评论(0) 推荐(0)
SPOJ BANLUM 数位dp+三进制状态压缩
摘要：Balanced numbers have been used by mathematicians for centuries. A positive integer is considered a balanced number if: 1) Every even digit appears an 阅读全文
posted @ 2019-05-16 22:09 kongbb 阅读(162) 评论(0) 推荐(0)
HDU 5358 枚举+尺选
摘要：soda has an integer array a1,a2,…,ana1,a2,…,an. Let S(i,j)S(i,j) be the sum of ai,ai+1,…,ajai,ai+1,…,aj. Now soda wants to know the value below: ∑i=1n 阅读全文
posted @ 2019-05-16 16:16 kongbb 阅读(169) 评论(0) 推荐(0)
ZOJ 4124 2019 ACM山东省赛 L题
摘要：Recall the definition of the median of elements where is odd: sort these elements and the median is the -th largest element. In this problem, the exac 阅读全文
posted @ 2019-05-13 22:45 kongbb 阅读(560) 评论(0) 推荐(0)
2019 ACM 山东省赛 总结
摘要：11 号上午到了济南大学，然后就是。。。走了一个中午的路emmm。。。。。济南大学真大啊，我从西门走到12号教学楼，又走到西门的大礼堂，再走回12号教学楼，热身赛结束再走回西门的宾馆，两万的步数，到了宾馆我和许哥哥的衣服都湿了。我感觉曲师校园小还挺好的。看了一下知乎才知道，济南大学还有个更大的南校区 阅读全文
posted @ 2019-05-13 18:33 kongbb 阅读(628) 评论(0) 推荐(0)
HDU 4352 数位dp + LIS(nlogn) + 状态压缩
摘要：#define xhxj (Xin Hang senior sister(学姐)) If you do not know xhxj, then carefully reading the entire description is very important. As the strongest f 阅读全文
posted @ 2019-05-09 15:35 kongbb 阅读(140) 评论(0) 推荐(0)
HDU 3709 数位dp
摘要：A balanced number is a non-negative integer that can be balanced if a pivot is placed at some digit. More specifically, imagine each digit as a box wi 阅读全文
posted @ 2019-05-07 15:18 kongbb 阅读(113) 评论(0) 推荐(0)
Educational Codeforces Round 64 (Rated for Div. 2)-C. Match Points
摘要：C. Match Pointstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output You are given a set of points x1 阅读全文
posted @ 2019-05-04 21:51 kongbb 阅读(213) 评论(0) 推荐(0)
ZOJ 4109 Welcome Party 并查集+优先队列+bfs
摘要：The 44th World Finals of the International Collegiate Programming Contest (ICPC 2020) will be held in Moscow, Russia. To celebrate this annual event f 阅读全文
posted @ 2019-05-03 19:16 kongbb 阅读(268) 评论(0) 推荐(0)
POJ 3685 Matrix
摘要：有一个N阶方阵 第i行,j列的值Aij =i2 + 100000 × i + j2 - 100000 × j + i × j,需要找出这个方阵的第M小值. 有一个N阶方阵 第i行,j列的值Aij =i2 + 100000 × i + j2 - 100000 × j + i × j,需要找出这个方阵的 阅读全文
posted @ 2019-05-01 17:13 kongbb 阅读(213) 评论(0) 推荐(0)