![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM_learning
文章平均质量分 80
K_HOLMES_
在校小新人,不断学习,ACM,robot,各类杂谈
展开
-
大数乘法_C++STL写法模板
用C++的STL写这种异常清晰,主要是两个函数,一个add函数把两个deuqe的值相加,得到最终答案,其实这个函数是最后执行的。首先执行的是一个deque的所有值依次乘一个整数这个整数是从另一个deque的值每次提取他的最后一个元素(低位)进行乘法操作。这样做的原理很简单,不清楚的朋友自己写两个数然后做乘法,模拟一下,看是不是一个数的每一位先乘另一个数的每一位,然后再把它们的n个(如果有n项和需要原创 2016-08-15 22:01:14 · 719 阅读 · 0 评论 -
hdu 3549 网络流EK裸题
科技大学! Flow ProblemTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 15898 Accepted Submission(s): 7517Problem Descrip原创 2017-05-31 20:42:21 · 320 阅读 · 0 评论 -
浙工大之江学院第0届校赛 持续补题
Problem A: qwb与支教Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 1463 Solved: 271[Submit][Status][Web Board]Descriptionqwb同时也是是之江学院的志愿者,暑期要前往周边地区支教,为了提高小学生的数学水平。她把小学生排成一排,从左至右从1开始依次往原创 2017-06-03 09:27:37 · 2864 阅读 · 0 评论 -
hdu6150 构造题_ccpc
Vertex CoverTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 256000/256000 K (Java/Others)Total Submission(s): 524 Accepted Submission(s): 207Special JudgeProblem Description原创 2017-08-21 14:59:08 · 584 阅读 · 0 评论 -
数位dp汇总
参考了一些博客中的题目推荐,然后再回顾并补充了下数位dp。原创 2017-08-21 15:05:52 · 278 阅读 · 0 评论 -
POJ2104 hdu2665 主席树入门 Kth-number
—网易游戏雷火盘古校园招聘开始!Kth numberTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12438 Accepted Submission(s): 3788Proble原创 2017-09-03 20:41:34 · 407 阅读 · 0 评论 -
可持续化Trie_区间异或最大_bzoj3261
Persistence Data Structure原创 2017-09-04 13:34:41 · 1356 阅读 · 0 评论 -
树状数组求逆序数
内容注释都在代码里面#include#include#include#include#includeusing namespace std;const int maxn = 5e5+10;vector v;int a[maxn],c[maxn],n;//看树状数组c[i]所管辖的范围可以用这个方法 下标i转成二进制 它的末尾o的个数k 带入 2^k即可得到他管辖的范围//8 =原创 2017-09-04 15:20:12 · 261 阅读 · 0 评论 -
Hdu_6166多源多汇最短路
Senior PanTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 424 Accepted Submission(s): 158Problem DescriptionSenior Pan fai原创 2017-08-23 10:57:43 · 458 阅读 · 0 评论 -
dijkstra_heap最短路堆优化
#include#include#include#include#includeusing namespace std;const int maxn=100+10;#define INF 1e9int n,m;struct Edge{ int u,v,w; Edge(int from,int to,int w):u(from),v(to),w(w) {}};原创 2017-08-23 10:59:38 · 413 阅读 · 0 评论 -
最大流板子
#includeusing namespace std;const int maxn = 10000;#define ll long long#define mod 10001 #define INF 1<<29 int s,t,level[maxn],head[maxn],cnt=0;int n,m; struct Node{ int to,next,val;}edge[ma原创 2017-09-19 10:48:09 · 445 阅读 · 0 评论 -
LCA_ST算法
#includeusing namespace std;const int maxn = 4e4+5;struct Edge{ int v,next,val;}edge[maxn*2]; //order 和 dep 需要开点的两倍 因为dfs序的时候记录两次 int fir[maxn],order[2*maxn],dep[2*maxn],head[maxn],dis[maxn],fat原创 2017-09-19 10:50:13 · 466 阅读 · 0 评论 -
HDU 2604_递推+矩阵快速幂
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5546 Accepted Submission(s): 2414Problem DescriptionQueues and Priority Queues原创 2017-05-10 12:28:45 · 385 阅读 · 0 评论 -
女生赛hdu6027
Problem DescriptionYou are encountered with a traditional problem concerning the sums of powers.Given two integers n and k. Let f(i)=ik, please evaluate the sum f(1)+f(2)+...+f(n). The pro原创 2017-05-08 20:20:03 · 1079 阅读 · 0 评论 -
KMP_小白解说
适合初学KMP的人谢谢支持原创 2016-08-14 21:58:03 · 623 阅读 · 0 评论 -
树状数组_应用的代码
树状数组的代码模板与解析原创 2016-09-15 10:57:07 · 323 阅读 · 0 评论 -
hdu 2955_背包经典
The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to work in the lucrative原创 2017-04-28 15:50:55 · 326 阅读 · 0 评论 -
hdu_1083_经典二分图
CoursesTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7487 Accepted Submission(s): 3664Problem DescriptionConsider a group原创 2017-04-28 15:56:58 · 211 阅读 · 0 评论 -
hdu2159_二维费用完全背包
FATETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13618 Accepted Submission(s): 6442Problem Description最近xhd正在玩一款叫做FATE的游戏,原创 2017-04-29 12:57:35 · 344 阅读 · 0 评论 -
hdu2844_多重背包
Whuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in a nearby shop. He wante原创 2017-04-29 13:03:11 · 228 阅读 · 0 评论 -
hdu_女生赛_6030递推+矩阵
Happy NecklaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 253 Accepted Submission(s): 99Problem DescriptionLittle Q wan原创 2017-05-10 18:26:14 · 434 阅读 · 0 评论 -
hdu_1054最小点覆盖树上
Strategic GameTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8139 Accepted Submission(s): 3891Problem DescriptionBob enjoy原创 2017-05-15 16:14:33 · 622 阅读 · 0 评论 -
zoj_最少点支配
ProhibitionTime Limit: 2 Seconds Memory Limit: 65536 KB Special JudgeMany people know Berland, the country that has been described at Saratov's contests for ten years. But this probl原创 2017-05-15 16:19:24 · 236 阅读 · 0 评论 -
女生赛HDU6023
Automatic JudgeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 104 Accepted Submission(s): 62Problem DescriptionWelcome to原创 2017-05-07 23:05:56 · 1005 阅读 · 0 评论 -
女生赛hdu6025
Do you know what is called ``Coprime Sequence''? That is a sequence consists of n positive integers, and the GCD (Greatest Common Divisor) of them is equal to 1.``Coprime Sequence'' is easy to fin原创 2017-05-07 23:12:25 · 729 阅读 · 0 评论 -
铺地板状压DP求方案数
原文链接:http://blog.csdn.net/my_sunshine26/article/details/74612684这道题搞了很久终于搞懂了,感觉受益匪浅,先贴上题目:题目一:UESTC 1690 这是一道比CCCC简单题难的简单题这是一道比CCCC简单题难的简单题Time Limit: 3000/1000MS (Java/Other转载 2017-09-02 09:50:51 · 847 阅读 · 0 评论