自定义博客皮肤VIP专享

*博客头图:

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

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

博客底图:

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

栏目图:

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

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

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

转载 ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 G题Bounce

#1584 : Bounce 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 For Argo, it is very interesting watching a circle bouncing in a rectangle. As shown in the figure below, the rectangle is di

2017-09-28 18:46:53 407

原创 计蒜客 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 The Heaviest Non-decreasing Subsequence Problem

Let SSS be a sequence of integers s1s_{1}s​1​​, s2s_{2}s​2​​, ........., sns_{n}s​n​​ Each integer is is associated with a weight by the following rules: (1) If is is negative, then its weight

2017-09-27 15:48:09 219

原创 hdu 1542 Atlantis (线段树求矩形面积并)

AtlantisTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14420    Accepted Submission(s): 5942Problem DescriptionThere are several ancient Greek ...

2017-09-26 20:04:58 299

原创 计蒜客 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 M. Frequent Subsets Problem (位压缩)

The frequent subset problem is defined as follows. Suppose UUU={1, 2,…\ldots…,N} is the universe, and S1S_{1}S​1​​, S2S_{2}S​2​​,…\ldots…,SMS_{M}S​M​​ are MMM sets over UUU. Given a posit

2017-09-24 20:42:22 256

原创 hdu 6178 Monkeys (dfs+FastIO)

Monkeys Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 153428/153428 K (Java/Others) Total Submission(s): 1307    Accepted Submission(s): 431 Problem Description There is a tree havin

2017-09-19 16:40:06 294

原创 hdu 6205 card card card (尺取法)

card card card Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1750    Accepted Submission(s): 780 Problem Description As a fan of Doud

2017-09-18 11:06:36 396

原创 计蒜客 2017 ACM-ICPC 亚洲区(西安赛区)网络赛 B coin(求乘法逆元)

Bob has a not even coin, every time he tosses the coin, the probability that the coin's front face up is qp(qp≤12)\frac{q}{p}(\frac{q}{p} \le \frac{1}{2})​p​​q​​(​p​​q​​≤​2​​1​​). The question is, w

2017-09-18 10:50:36 585

原创 hdu 6201 transaction transaction transaction (spfa求最长路)

transaction transaction transaction Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 132768/132768 K (Java/Others) Total Submission(s): 1518    Accepted Submission(s): 733 Problem Descri

2017-09-15 16:38:59 185

原创 hdu 6197 array array array (LIS,最长上升子序列模板题)

array array array Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 727    Accepted Submission(s): 421 Problem Description One day, Kaito

2017-09-15 15:35:41 304

空空如也

空空如也

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

TA关注的人

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