##其它算法
文章平均质量分 87
GDRetop
这个作者很懒,什么都没留下…
展开
-
旅行商问题
package com.cainiao.thub.client.it;import java.io.IOException;import java.nio.file.Files;import java.nio.file.Paths;import java.util.List;import java.util.Random;public class Test { public static void main(String[] args) throws IOException.原创 2020-10-23 10:00:05 · 237 阅读 · 1 评论 -
hdu 5358 First One 2015多校联合训练赛#6 枚举
First OneTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 142 Accepted Submission(s): 37Problem Descriptionsoda has an integ原创 2015-08-06 18:40:55 · 1396 阅读 · 0 评论 -
hdu 5334 Virtual Participation 构造
Virtual ParticipationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 639 Accepted Submission(s): 180Special JudgeProblem Descript原创 2015-08-02 13:54:09 · 532 阅读 · 0 评论 -
hdu 5338 ZZX and Permutations 2015多校联合训练赛,贪心,线段树,树状数组
ZZX and PermutationsTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 141 Accepted Submission(s): 24Problem DescriptionZZX li原创 2015-07-30 19:29:35 · 787 阅读 · 0 评论 -
hdu 5324 Boring Class 2015多校联合训练赛3 分治,最长不降子序列,最小字典序
Boring ClassTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 354 Accepted Submission(s): 75Problem DescriptionMr. Zstu and Mr.原创 2015-07-29 16:23:46 · 1281 阅读 · 0 评论 -
zoj 3329 One Person Game 动态规划,迭代法,二分
题意:给三个骰子,骰子有k1,k2,k3个面。每次掷骰子,得到的点数和为前进的步数,如果掷骰子的结果为c1,c2,c3(有序)则回到原点。从0点出发,到达大于N的点,则游戏结束。求掷骰子次数的期望。转移方程为: dp[i] = dp[i+l1+l2+l3]*(1/k1/k2/k3)+dp[0]*(1/k1/k2/k3)+1其中枚举l1,l2,l3为掷骰子得原创 2015-07-20 18:03:15 · 808 阅读 · 0 评论 -
hdu 5126 stars cdq分治
starsTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 282 Accepted Submission(s): 68Problem DescriptionJohn loves to see the sky原创 2015-02-09 11:01:33 · 1159 阅读 · 0 评论 -
hdu 1055 Color a Tree 贪心
Color a TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1096 Accepted Submission(s): 357Problem DescriptionBob is very in原创 2014-09-22 22:20:28 · 1026 阅读 · 0 评论 -
Viterbi 算法
import java.util.*;/** * https://zh.wikipedia.org/zh-hans/%E7%BB%B4%E7%89%B9%E6%AF%94%E7%AE%97%E6%B3%95 * https://vimsky.com/article/863.html * @author gdretop * @date 2019/7/12 */public cla...原创 2019-07-12 17:19:59 · 240 阅读 · 0 评论 -
hdu 5381 The sum of gcd 2015多校联合训练赛#8莫队算法
The sum of gcdTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 23 Accepted Submission(s): 4Problem DescriptionYou have an arra原创 2015-08-13 18:27:45 · 1691 阅读 · 0 评论 -
hdu 5400 Arithmetic Sequence 2015多校联合训练赛#9 枚举
Arithmetic SequenceTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 624 Accepted Submission(s): 280Problem DescriptionA sequen原创 2015-08-19 14:22:09 · 833 阅读 · 0 评论 -
hdu 5414 CRB and String 2015多校联合训练赛#10 贪心
CRB and StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 246 Accepted Submission(s): 90Problem DescriptionCRB has two st原创 2015-08-20 20:22:05 · 808 阅读 · 2 评论 -
2015多校联合训练赛 hdu 5308 I Wanna Become A 24-Point Master 2015 Multi-University Training Contest 2 构造题
I Wanna Become A 24-Point MasterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 60 Accepted Submission(s): 16Special JudgeProblem原创 2015-07-23 19:10:58 · 1129 阅读 · 2 评论 -
Timus Online Judge 2055. Urban Geography 分治,可回溯并查集,
2055. Urban GeographyTime limit: 2.0 secondMemory limit: 128 MBAndroid Vasya prepares a project in Urban geography. The aim of the project is to improve the infrasructure of the city he原创 2015-08-24 16:09:11 · 1036 阅读 · 0 评论 -
hdu 5412 CRB and Queries 2015多校联合训练赛#10 分治 求区间第k大数
CRB and QueriesTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 636 Accepted Submission(s): 162Problem DescriptionThere are原创 2015-08-22 11:39:06 · 1067 阅读 · 0 评论 -
hdu 5416 CRB and Tree 2015多校联合训练赛#10 枚举
CRB and TreeTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 628 Accepted Submission(s): 198Problem DescriptionCRB has a tree,原创 2015-08-21 15:37:49 · 529 阅读 · 0 评论 -
NBUT 1457 Sona 莫队算法 分块处理
[1457] Sona时间限制: 5000 ms 内存限制: 65535 K问题描述Sona, Maven of the Strings. Of cause, she can play the zither.Sona can't speak but she can make fancy music. Her music can attack, heal,原创 2015-08-21 14:00:24 · 978 阅读 · 0 评论 -
大视野在线测评:2038: [2009国家集训队]小Z的袜子(hose) 莫队算法,分块处理
2038: [2009国家集训队]小Z的袜子(hose)Time Limit: 20 Sec Memory Limit: 259 MBSubmit: 4317 Solved: 1972[Submit][Status][Discuss]Description作为一个生活散漫的人,小Z每天早上都要耗费很久从一堆五颜六色的袜子中找出一双来穿。终于有一天,小Z再也无法忍受这恼人原创 2015-08-21 11:19:13 · 1356 阅读 · 0 评论 -
UVAlive 3662 Another Minimum Spanning Tree 莫队算法,曼哈顿最小生成树
现成的东西,就不自己写了。转载请注明出处,谢谢http://blog.csdn.net/ACM_cxlove?viewmode=contents by---cxlove二维平面中有一些点,两点之间的距离为曼哈顿距离,求最小生成树。朴素的n个点,只能做到O(n^3)或者O(n^2 lgn)。但是针对这种曼哈顿距离的MST。其中有个性质是:对于某个点,以他为中心的区域分为8个象限,对原创 2015-08-21 11:11:18 · 1005 阅读 · 0 评论 -
poj 3241 Object Clustering 莫队算法,曼哈顿最小生成树
Object ClusteringTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 1732 Accepted: 432DescriptionWe have N (N ≤ 10000) objects, and wish to classify the原创 2015-08-21 10:49:59 · 1156 阅读 · 0 评论 -
编程之美:第一章游戏之乐-饮料供货问题
书中已经提到了用背包方法解,复杂度为V*N*max(C),空间复杂度为O(v)这里想了一些其它方法以及谈谈书中提到的贪心算法方法1: 采用单调队列优化复杂度为O(V*n),空间为2*V单调队列优化方法参考背包九讲。是可以实现的。但n很大的时候,就不是很好了方法2:二进制表示法优化复杂度O(V*N*log(C)),空间为V同样参考背包九讲,对C分解成1,2,4,8原创 2017-08-17 19:20:32 · 456 阅读 · 0 评论