E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
——概率DP
麻球繁衍(
概率DP
)
1487.麻球繁衍★ 输入文件:tribbles.in 输出文件:tribbles.out 评测插件时间限制:3s 内存限制:256MB【题目描述】万有引力定律:“使物体相互靠近的力的大小与物体的质量成正比——而物体的质量又由同一种力决定。这是一个有趣并且有益的例子,说明了科学是如何用A证明B,再用B证明A的。”——安布罗斯·比尔斯(美国讽刺作家——译者注)。你有一坨K个毛球(中的种族—
clover_hxy
·
2016-05-02 20:00
Codeforces-148D Bag of mice (
概率DP
)
D.Bagofmicehttp://www.codeforces.com/problemset/problem/148/Dtimelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputThedragonandtheprincessarearguingaboutwhattodoo
idealism_xxm
·
2016-05-02 10:00
codeforces
概率DP
ZOJ-3640 Help Me Escape (
概率DP
)
HelpMeEscapehttp://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=4808TimeLimit: 2Seconds MemoryLimit: 32768KBBackground Ifthoudoestwell,shaltthounotbeaccepted?andifthoudoestnotwell,sinlie
idealism_xxm
·
2016-05-01 21:00
ZOJ
概率DP
POJ-3071 Football (
概率DP
)
Footballhttp://poj.org/problem?id=3071TimeLimit: 1000MS MemoryLimit: 65536K DescriptionConsiderasingle-eliminationfootballtournamentinvolving2n teams,denoted1,2,…,2n.Ineachroundofthetournament,allte
idealism_xxm
·
2016-05-01 21:00
poj
概率DP
HDU-3853 LOOPS (
概率DP
)
LOOPShttp://acm.hdu.edu.cn/showproblem.php?pid=3853TimeLimit:15000/5000MS(Java/Others) MemoryLimit:125536/65536K(Java/Others)ProblemDescriptionAkemiHomuraisaMahouShoujo(PuellaMagi/MagicalGirl).Homu
idealism_xxm
·
2016-05-01 20:00
HDU
概率DP
HDU-4599 Dice (
概率DP
)
Dicehttp://acm.hdu.edu.cn/showproblem.php?pid=4599TimeLimit:2000/1000MS(Java/Others) MemoryLimit:65535/65535K(Java/Others)ProblemDescriptionGivenanormaldice(with1,2,3,4,5,6oneachface),wedefine: F(N
idealism_xxm
·
2016-05-01 16:00
HDU
概率DP
概率练习 (16.04.30)
继之前的
概率dp
,这次博文同样和概率相关,但不仅仅限于dp处理。UVA-10288Couponshttps://uva.onlinejudge.org/index.php?
theArcticOcean
·
2016-04-30 18:00
概率
POJ 3744 Scout YYF I (矩阵相乘+
概率DP
)
POJ3744ScoutYYFI(矩阵相乘+
概率DP
):http://poj.org/problem?
PNAN222
·
2016-04-30 17:00
矩阵相乘
概率DP
ACdream 1113 The Arrow (
概率DP
)
ACdream1113TheArrow(
概率DP
):http://acm.hust.edu.cn/vjudge/contest/view.action?
PNAN222
·
2016-04-30 16:00
概率DP
POJ 3071 Football (
概率DP
)
POJ3071Football(
概率DP
):http://poj.org/problem?
PNAN222
·
2016-04-30 14:00
概率DP
HDU-4035 Maze (
概率DP
&&树形DP)
Mazehttp://acm.hdu.edu.cn/showproblem.php?pid=4035TimeLimit:2000/1000MS(Java/Others) MemoryLimit:65768/65768K(Java/Others)SpecialJudgeProblemDescriptionWhenwakeup,lxhgwwfindhimselfinahugemaze.Thema
idealism_xxm
·
2016-04-30 12:00
HDU
树形DP
概率DP
HDU 4652 Dice (
概率DP
)
传送门DiceTimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/65536K(Java/Others)TotalSubmission(s):470AcceptedSubmission(s):323SpecialJudgeProblemDescriptionYouhaveadicewithmfaces,eachfacecontainsadisti
qingshui23
·
2016-04-30 12:00
概率DP
HDU Walk (
概率DP
)
HDUWalk(
概率DP
):http://acm.hdu.edu.cn/showproblem.php?
PNAN222
·
2016-04-30 11:00
枚举
概率DP
ZOJ-3329 One Person Game (
概率DP
)
OnePersonGamehttp://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=3754TimeLimit: 1Second MemoryLimit: 32768KB SpecialJudgeThereisaverysimpleandinterestingone-persongame.Youhave3dice,name
idealism_xxm
·
2016-04-30 09:00
ZOJ
概率DP
HDU-4405 Aeroplane chess (
概率DP
)
Aeroplanechesshttp://acm.hdu.edu.cn/showproblem.php?pid=4405TimeLimit:2000/1000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)ProblemDescriptionHzzlovesaeroplanechessverymuch.Thechessmapconta
idealism_xxm
·
2016-04-29 23:00
HDU
概率DP
hdu 4652(
概率dp
)
题目链接:点击打开链接;题意:给定一个m个面的骰子然后给定两种询问,0mn,表示求丢多少次使得最后丢的n次都相同的期望,1mn表示求最后丢的n次两两不相同的期望。;题目分析:我们设dp[i]为当前为i个连续的数还需投掷次数的期望搭dp[0]就是解在相同的情况:dp[i]记录的是已经连续i个相同,到n个不同需要的次数的数学期望dp[0]=1+dp[1]dp[1]=1+(1/m*dp[2]+(m-1)
qq_27599517
·
2016-04-29 19:00
dp
概率DP
hdu5001(
概率dp
)
分析:简单的
概率dp
,设dp[i][j]为走i步在j点的概率,然后dp[j][d]=∑dp[k][d-1]/edge[k].size();然后一球就行了;代码如下:#include #include #
qq_27599517
·
2016-04-29 19:00
概率DP
POJ-2096 Collecting Bugs (
概率DP
)
CollectingBugshttp://poj.org/problem?id=2096TimeLimit: 10000MS MemoryLimit: 64000K CaseTimeLimit: 2000MS SpecialJudgeDescriptionIvanisfondofcollecting.Unlikeotherpeoplewhocollectpoststamps,coinsorot
idealism_xxm
·
2016-04-29 15:00
poj
概率DP
POJ 3071 Football (
概率DP
)
题意有2n个队伍,每次相邻的两个比赛一轮一轮淘汰求胜利概率最大的队伍。思路令dp[i][j]表示第i支队伍在第j轮胜利的概率,那么显然答案就是max(dp[i][n]),然后dp到枚举他第j轮的对手卡住了,然后画了一个树形的赛程图就发现i在第j轮的对手实际上是以从下往上第j层为节点的i所在的那个子树的除了第一轮被i淘汰的队伍之外的其他队伍。然后发下这个之后就能从二进制位上找到规律了,把队伍从0开始
Dreamon3
·
2016-04-29 15:00
dp
poj
POJ-3744 Scout YYF I (
概率DP
&&矩阵快速幂)
ScoutYYFIhttp://poj.org/problem?id=3744TimeLimit: 1000MS MemoryLimit: 65536K DescriptionYYFisacouragousscout.Nowheisonadangerousmissionwhichistopenetrateintotheenemy'sbase.Afterovercomingaseriesdiff
idealism_xxm
·
2016-04-29 11:00
poj
概率DP
SDUT-2878-Circle(
概率DP
/高斯消元)
CircleTimeLimit:2000ms Memorylimit:65536K 有疑问?点这里^_^题目描述Youhavebeengivenacirclefrom0ton - 1.Ifyouarecurrentlyatx,youwillmoveto(x - 1)modnor(x + 1)modnwithequalprobability.Nowwewanttoknowtheexpectedn
qq978874169
·
2016-04-28 21:00
C++
ACM
HDU 5001 Walk (
概率DP
)
传送门WalkTimeLimit:30000/15000MS(Java/Others)MemoryLimit:65536/65536K(Java/Others)TotalSubmission(s):996AcceptedSubmission(s):634SpecialJudgeProblemDescriptionIusedtothinkIcouldbeanything,butnowIknowtha
qingshui23
·
2016-04-28 11:00
概率DP
Acedream 1113 The Arrow(
概率DP
)
传送门TheArrowTimeLimit:1000MSMemoryLimit:64000KB64bitIOFormat:%lld&%lluSubmitStatusDescriptionThehistoryshowsthatWeneedheroesineverydynasty.Forexample,LiangshanHeroes.Peoplehopethattheseheroescanpunisht
qingshui23
·
2016-04-28 11:00
概率
期望
POJ 3744 Scout YYF I(
概率DP
)
传送门ScoutYYFITimeLimit:1000MSMemoryLimit:65536KTotalSubmissions:7221Accepted:2106DescriptionYYFisacouragousscout.Nowheisonadangerousmissionwhichistopenetrateintotheenemy’sbase.Afterovercomingaseriesdif
qingshui23
·
2016-04-28 10:00
概率DP
ACdream 113 The Arrow (
概率DP
)
传送门TheArrowTimeLimit: 2000/1000MS(Java/Others) MemoryLimit: 128000/64000KB(Java/Others)Submit Statistic NextProblemProblemDescriptionThehistoryshowsthatWeneedheroesineverydynasty. Forexample, Liangsha
qingshui23
·
2016-04-26 17:00
POJ 3071 Football(
概率DP
)
传送门FootballTimeLimit: 1000MSMemoryLimit: 65536KTotalSubmissions: 4366Accepted: 2231DescriptionConsiderasingle-eliminationfootballtournamentinvolving2n teams,denoted1,2,…,2n.Ineachroundofthetournament,
qingshui23
·
2016-04-25 17:00
概率DP
ZOJ 3822 Domination
概率DP
入门
题目描述:DescriptionEdwardistheheadmasterofMarjarUniversity.Heisenthusiasticaboutchessandoftenplayschesswithhisfriends.What’smore,heboughtalargedecorativechessboardwithNrowsandMcolumns.Everydayafterwork,E
wuxuanyi27
·
2016-04-22 19:00
dp
[
概率DP
] BZOJ 3036 绿豆蛙的归宿
好水的题#include #include #include #include #defineVG[p].v usingnamespacestd; typedefpairabcd; inlinecharnc() { staticcharbuf[100000],*p1=buf,*p2=buf; if(p1==p2){p2=(p1=buf)+fread(buf,1,100000,stdin);if(
u014609452
·
2016-04-22 10:00
hdu4405(
概率dp
)
链接:点击打开链接题意:飞行棋从0点到n点,扔骰子,前进中会有捷径[xi,yi],表示从xi点不用扔骰子直接到yi点,问到达n时平均置骰子次数的期望代码:#include #include #include #include #include #include #include usingnamespacestd; intson[100005]; doubledp[100005]
stay_accept
·
2016-04-21 21:00
HDU 3076 ssworld VS DDD
概率DP
入门
题目描述:ProblemDescriptionOneday,sssworldandDDDplaygamestogether,buttherearesomespecialrulesinthisgames.TheybothhavetheirownHP.EachroundtheydicerespectivelyandgetthepointsP1andP2(1 #include #include usi
wuxuanyi27
·
2016-04-21 12:00
概率DP
zoj3822(
概率dp
)
链接:点击打开链接题意:一个n行m列的棋盘,每次放一个棋子,问要使得棋盘的每行每列都至少有一个棋子,需要的放棋子次数的期望代码:#include #include #include #include #include #include #include usingnamespacestd; doubledp[55][55][3005]; intmain(){ doubleans
stay_accept
·
2016-04-20 21:00
POJ 3071 Football【
概率DP
】
id=3071思路
概率DP
,方程本身很简单,设dp[i][j]为第i支队伍撑过第j轮的概率。
wlx65003
·
2016-04-18 21:00
dp
ACM
概率
HDU 5001 Walk
概率DP
入门!
题目描述:ProblemDescriptionIusedtothinkIcouldbeanything,butnowIknowthatIcouldn’tdoanything.SoIstartedtraveling.Thenationlookslikeaconnectedbidirectionalgraph,andIamrandomlywalkingonit.ItmeanswhenIamatnode
wuxuanyi27
·
2016-04-17 20:00
概率DP
山东省第四届ACM大学生程序设计竞赛 The number of steps
概率dp
ThenumberofstepsTimeLimit:1000ms Memorylimit:65536K 有疑问?点这里^_^题目描述 Marystandsinastrangemaze,themazelookslikeatriangle(thefirstlayerhaveoneroom,thesecondlayerhavetworooms,thethirdlayerhavethreerooms
zp___waj
·
2016-04-16 09:00
C++
dp
[
概率DP
] Topcoder SRM687div2 1000 Queueing
题意:两列队伍,左边有len1个人,右边有len2个人,问事件左边没人但右边有人的概率。两边收银员各有一个经验值参数p,F(p,k)=(1/p)∗(1−1/p)k−1表示经验值为p的收银员恰好花费k秒完成一次收银的概率。题解:首先发现F(p,k)十分眼熟,满足几何分布,所以每秒成功收银的概率是1/p,设左边成功收银概率a=1/p1,右边为b=1/p2。设左边没人但右边有人为事件A,则答案是求P(A
kg20006
·
2016-04-15 21:00
dp
topcoder
hdu4405(
概率dp
)
AeroplanechessTimeLimit:2000/1000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):2958 AcceptedSubmission(s):1902ProblemDescriptionHzzlovesaeroplanechessverymuch.Thechessm
martinue
·
2016-04-15 17:00
dp
ACM
大二
hdu5001(
概率dp
)
WalkTimeLimit:30000/15000MS(Java/Others) MemoryLimit:65536/65536K(Java/Others)TotalSubmission(s):957 AcceptedSubmission(s):610SpecialJudgeProblemDescriptionIusedtothinkIcouldbeanything,butnowIkn
martinue
·
2016-04-14 22:00
dp
ACM
大二
CDOJ 1135 邱老师看电影
概率dp
概率dp
,推一个概率公式就行。
sky-edge
·
2016-04-14 13:47
数据结构
CDOJ
CDOJ 1135 邱老师看电影
概率dp
概率dp
,推一个概率公式就行。
code12hour
·
2016-04-14 13:00
lightoj 1038 - Race to 1 Again 【
概率dp
】
题目链接:lightoj1038-Raceto1Again1038-Raceto1AgainPDF(English)StatisticsForumTimeLimit:2second(s)MemoryLimit:32MBRimilearnedanewthingaboutintegers,whichis-anypositiveintegergreaterthan1canbedividedbyitsdi
chenzhenyu123456
·
2016-04-13 22:00
hdu 4405 Aeroplane chess
概率dp
入门题
DescriptionHzzlovesaeroplanechessverymuch.ThechessmapcontainsN+1gridslabeledfrom0toN.Hzzstartsatgrid0.Foreachstephethrowsadice(adicehavesixfaceswithequalprobabilitytofaceupandthenumbersonthefacesare1,
reborn_ZhMZ
·
2016-04-13 22:00
POJ 3071 Football (
概率DP
)
FootballTimeLimit: 1000MS MemoryLimit: 65536KTotalSubmissions: 4344 Accepted: 2220DescriptionConsiderasingle-eliminationfootballtournamentinvolving2n teams,denoted1,2,…,2n.Ineachroundofthetournament,a
aozil_yang
·
2016-04-12 17:00
dp
动态规划
C语言
HDU 4487 Maximum Random Walk (
概率DP
)
MaximumRandomWalkTimeLimit:2000/1000MS(Java/Others) MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):505 AcceptedSubmission(s):279ProblemDescriptionConsidertheclassicrandomwalk:ateachstep
aozil_yang
·
2016-04-12 00:00
dp
动态规划
C语言
HDU 4487 Maximum Random Walk(
概率DP
)
题目链接:点击打开链接思路:
概率DP
,用d[i][j][k]表示第i步,走到j点,走过的最大值为k的概率。 然后最后用概率乘以最右边走到的点就是期望,期望相加就是答案。
weizhuwyzc000
·
2016-04-10 10:00
HDU
ACM-ICPC
概率DP
cf#301-D - Bad Luck Island-
概率dp
(水 )
http://codeforces.com/contest/540/problem/D题意:给三种人,分别是r,s,p个;在孤岛上,每两个不同种人相遇则互吃,r吃s,s吃p,p吃r求最后留下单一种族的概率设dp[i][j][k]为剩下i个r,j个s,k个p的概率,那么可以得到当r和p相遇,dp[i-1][j][k]+=dp[i][j][k]*(i*k)/(i*j+j*k+k*i);同理推出另外2种
viphong
·
2016-04-07 01:00
hdoj 1437 天气情况 【
概率dp
】
题目链接:hdoj1437天气情况天气情况TimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):714AcceptedSubmission(s):291ProblemDescription如果我们把天气分为雨天,阴天和晴天3种,在给定各种天气之间转换的概率,例如雨天转换成雨
笑着走完自己的路
·
2016-04-04 16:20
概率DP
hdoj 1437 天气情况 【
概率dp
】
题目链接:hdoj1437天气情况天气情况TimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):714AcceptedSubmission(s):291ProblemDescription如果我们把天气分为雨天,阴天和晴天3种,在给定各种天气之间转换的概率,例如雨天转换成雨
chenzhenyu123456
·
2016-04-04 16:00
ACM
,高斯消元,中国剩余定理,莫比乌斯反演2、图论最短路,最小生成树,拓扑排序,二分图,最大团,最大流,强连通分量,最近公共祖先,次小生成树,欧拉回路,哈密顿回路3、动态规划背包问题,树形DP,数位DP,
概率
mymilkbottles
·
2016-04-04 12:00
【BZOJ2246】[SDOI2011]迷宫探险【搜索】【
概率DP
】
【BZOJ2246】最后一组数据没过,也不知道啥原因,打了发表(pia)大体思路是,先搜索出每个状态下每个陷阱有害的概率,然后就可以跑dp了。搜索时,每个陷阱有三种状态,0无害,1有害,2未遍历。那么用一个三进制来表示状态。搜索到一种状态now,然后再枚举状态转移。设wx[now][i]表示当前状态为now,陷阱i有害的概率。设ww[i][0/1](是个临时数组)表示当前状态下(即now),陷阱i
BraketBN
·
2016-04-03 09:00
搜索
概率DP
POJ 3744
概率dp
#include #include #include #include usingnamespacestd; structMatrix { doublemat[2][2]; }; Matrixmul(Matrixa,Matrixb) { Matrixret; for(inti=0;i>=1; } returnret; } intinp[30],n; doublep; intmain(intargc
Tczxw
·
2016-04-01 16:00
上一页
4
5
6
7
8
9
10
11
下一页
按字母分类:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他