陈小玉算法训练营
upcupc_
这个作者很懒,什么都没留下…
展开
-
POJ 最近公共祖先(裸LCA)
数据量不大直接走暴力比较简单#include<iostream>#include<cstdlib>#include<sstream>#include<cstdio>#include<stack>#include<cstdio>#include<map>#include<set>#include<queue>#include<cstring>#include&l原创 2022-03-13 17:39:11 · 110 阅读 · 0 评论 -
POJ 3368 最频繁值 (裸ST)
#include<iostream>#include<cstdlib>#include<sstream>#include<cstdio>#include<stack>#include<cstdio>#include<map>#include<set>#include<queue>#include<cstring>#include<cmath>#inclu.原创 2022-03-13 16:41:09 · 154 阅读 · 0 评论 -
POJ 3264 区间最差值(裸ST)
#include<iostream>#include<cstdlib>#include<sstream>#include<cstdio>#include<stack>#include<cstdio>#include<map>#include<set>#include<queue>#include<cstring>#include<cmath>#inclu.原创 2022-03-13 16:38:43 · 76 阅读 · 0 评论 -
POJ 2431 丛林探险(优先队列)
额,错误代码WA得莫名其妙#include<iostream>#include<cstdlib>#include<sstream>#include<cstdio>#include<stack>#include<cstdio>#include<map>#include<set>#include<queue>#include<cstring>#include<c原创 2022-03-13 16:37:07 · 114 阅读 · 0 评论 -
POJ 2019二维区间最差值(ST)
#include<iostream>#include<cstdlib>#include<sstream>#include<cstdio>#include<stack>#include<cstdio>#include<map>#include<set>#include<queue>#include<cstring>#include<cmath>#inclu.原创 2022-03-13 16:33:35 · 133 阅读 · 0 评论 -
ST 算法
ST算法采用的是倍增的思想,先用O(nlogn)的时间构造一个二维表之后,可以在O(1)的时间查询[l,r]区间的最值1.ST创建若F[i,j]表示[i,i+2^j-1]区间的最值,区间长度为2^j,则i和j的取值范围是多少呢?若数组的长度为n,最大区间长度2^(k)<=n<2^(k+1),则k=[log2(n)],比如n=8时k=3.在程序中,k=log2(n),也可用通用表达方式k=log(n)/log(2),log()表示以e为底的自然对数算法代码:void S...原创 2022-03-08 22:03:24 · 8649 阅读 · 0 评论 -
POJ 3253(优先队列)
这道题的思路有点怪 哈夫曼树的思路先取两个最小的,再把这两个的和加入队列,把这两个小的数弹出队列#include<iostream>#include<cstdlib>#include<sstream>#include<cstdio>#include<stack>#include<cstdio>#include<map>#include<set>#include<queue>原创 2022-03-08 09:19:38 · 127 阅读 · 0 评论 -
POJ 2833(优先队列)
#include<iostream>#include<cstdlib>#include<sstream>#include<cstdio>#include<stack>#include<cstdio>#include<map>#include<set>#include<queue>#include<cstring>#include<cmath>#inclu.原创 2022-03-08 09:13:55 · 151 阅读 · 0 评论 -
POJ 1182食物链(带权并查集)
//首先重新定义题目中的关系,A与B的关系是0代表A与B同类。1代表A吃B,2代表B吃A//也就是题目中的d-1//利用传递性,A与B的关系和B与C的关系推出A与C的关系// A与B B与C A与C// 0 0 0// 0 1 1// 0 2 2// 1 0 1// 1 1 2// 1 2 0// 2 0 2// 2 1 0// 2 2 1 //立即推得A与C的关系=(A与B的关系+B与C的关系)%3//接着..原创 2022-03-06 17:46:24 · 53 阅读 · 0 评论 -
POJ 1988(简单并查集)
#include<iostream>#include<cstdlib>#include<sstream>#include<cstdio>#include<stack>#include<cstdio>#include<map>#include<set>#include<queue>#include<cstring>#include<cmath>#inclu.原创 2022-03-05 19:55:14 · 140 阅读 · 0 评论 -
HDU 1232(简单并查集)
#include<iostream>#include<cstdlib>#include<sstream>#include<cstdio>#include<stack>#include<cstdio>#include<map>#include<set>#include<queue>#include<cstring>#include<cmath>#inclu.原创 2022-03-05 12:33:49 · 53 阅读 · 0 评论