码迷,mamicode.com
首页 >  
搜索关键字:biridian forest    ( 387个结果
CF 429C
Iahub and Iahubina went to a picnic in a forest full of trees. Less than 5 minutes passed before Iahub remembered of trees from programming. Moreover,...
分类:其他好文   时间:2015-05-24 11:18:36    阅读次数:124
hdu 1142 A Walk Through the Forest
最短路+记忆化搜索#include#include#include#include#includeusing namespace std;const int maxn = 1003;const int INF = 0x3f3f3f3f;vectorljb[maxn];int jz[maxn][max...
分类:其他好文   时间:2015-05-23 15:27:09    阅读次数:120
hdu 1512 Monkey King 左偏树
题目链接:HDU - 1512Once in a forest, there lived N aggressive monkeys. At the beginning, they each does things in its own way and none of them knows each ...
分类:其他好文   时间:2015-05-21 21:39:22    阅读次数:250
hdu 1512 Monkey King 左偏树
题目链接:HDU - 1512Once in a forest, there lived N aggressive monkeys. At the beginning, they each does things in its own way and none of them knows each ...
分类:其他好文   时间:2015-05-21 19:15:56    阅读次数:138
[swustoj 856] Huge Tree
Huge Tree(0856)问题描述There are N trees in a forest. At first, each tree contains only one node as its root. And each node is marked with a number.You're...
分类:其他好文   时间:2015-05-16 16:12:37    阅读次数:115
Spark随机森林实现学习
前言 最近阅读了spark mllib(版本:spark 1.3)中Random Forest的实现,发现在分布式的数据结构上实现迭代算法时,有些地方与单机环境不一样。单机上一些直观的操作(递归),在分布式数据上,必须进行优化,否则I/O(网络,磁盘)会消耗大量时间。本文整理spark随机森林实现中...
分类:其他好文   时间:2015-05-03 14:37:06    阅读次数:317
Hdoj 1428 A Walk Through the Forest 【spfa】+【记忆化搜索】
A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6397 Accepted Submission(s): 2348Problem Description Jimmy experie...
分类:其他好文   时间:2015-05-03 00:52:15    阅读次数:163
ML—随机森林·1
Introduction to Random forest(Simplified)With increase in computational power, we can now choose algorithms which perform very intensive calculations....
分类:其他好文   时间:2015-04-28 17:39:58    阅读次数:367
hdu3182---Hamburger Magi(状压dp)
Problem Description In the mysterious forest, there is a group of Magi. Most of them like to eat human beings, so they are called “The Ogre Magi”, but there is an special one whose favorite food is ha...
分类:其他好文   时间:2015-04-28 14:08:31    阅读次数:129
HDU ACM 1142 A Walk Through the Forest->SPFA算法+记忆化深搜
分析:找到吉米从办公室穿过森林回到家(也就是从点1到点2)的最短路径有多少条,其中要满足如果要走A到B这条路,那么就有从A到终点的距离都大于B到终点的距离。 解法:spfa算法+记忆化深搜 1、spfa求出从终点2到其他所有点的最短路 2、记忆化DFS从1开始向其他点深搜,最后结果就是dp[1]。 #include #include using namespace std; ...
分类:编程语言   时间:2015-04-28 09:55:16    阅读次数:145
387条   上一页 1 ... 29 30 31 32 33 ... 39 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!