自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(6)
  • 收藏
  • 关注

原创 CodeForces_1400E Clear the Multiset(分治)

Clear the Multisettime limit per test:2 secondsmemory limit per test:256 megabytesProblem DescriptionYou have a multiset containing several integers. Initially, it contains a1a_1a1​ elements equal to 1, a2a_2a2​ elements equal to 2, …, ana_nan​ element

2020-08-28 16:17:41 165

原创 ZOJ_3009 Spread Sheet(拓扑排序)

Spread SheetTime Limit: 2000 msMemory Limit: 65536 KBProblem DescriptionIn 1979, Dan Bricklin and Bob Frankston wrote VisiCalc, the first spreadsheet application. It became a huge success and, at that time, was the killer application for the Apple II c

2020-08-19 19:06:06 176

原创 洛谷_2470 [SCOI2007]压缩

[SCOI2007]压缩题目链接:https://www.luogu.com.cn/problem/P2470题解:区间DP。设dp[i][j]dp[i][j]dp[i][j]代表字母iii前面有字母‘M’,字符串[i,j][i,j][i,j]子段压缩后的最短长度。递推式:dp[i][j]=min(dp[i][j],dp[i][k]+j−k)(i≤k<j)dp[i][j] = min(dp[i][j], dp[i][k]+j-k)(i\le k<j)dp[i][j]=min(dp[i]

2020-08-16 16:02:54 100

原创 HDU_3951 Coin Game(博弈)

Coin GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionAfter hh has learned how to play Nim game, he begins to try another coin game which seems much easier.The game goes like this:Two players s

2020-08-12 16:48:22 233

原创 CodeForces_590C Three States(BFS)

Three Statestime limit per test:5 secondsmemory limit per test:512 megabytesProblem DescriptionThe famous global economic crisis is approaching rapidly, so the states of Berman, Berance and Bertaly formed an alliance and allowed the residents of all me

2020-08-10 16:37:31 125

原创 CodeForces_1139D Steps to One(数论)

Steps to Onetime limit per test:2 secondsmemory limit per test:256 megabytesProblem DescriptionVivek initially has an empty array a and some integer constant m.He performs the following algorithm:Select a random integer x uniformly in range from 1 t

2020-08-04 20:40:09 248

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除