思维题
文章平均质量分 69
elbadaernu
这个作者很懒,什么都没留下…
展开
-
New Year Book Reading CodeForces - 500C
New Year Book Reading CodeForces - 500C题目描述 New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the转载 2017-03-25 20:57:02 · 356 阅读 · 0 评论 -
hdu5256 序列变换(LIS模型)
Problem Description 我们有一个数列A1,A2…An,你现在要求修改数量最少的元素,使得这个数列严格递增。其中无论是修改前还是修改后,每个元素都必须是整数。 请输出最少需要修改多少个元素。Input 第一行输入一个T(1≤T≤10),表示有多少组数据每一组数据:第一行输入一个N(1≤N≤105),表示数列的长度第二行输入N个数A1,A2,…,An。每一个数列中的元素都是正整数原创 2017-08-31 22:09:53 · 305 阅读 · 0 评论 -
B. Tell Your World Codeforces Round #431 (Div. 2)(简单模拟)
Connect the countless points with lines, till we reach the faraway yonder.There are n points on a coordinate plane, the i-th of which being (i, yi).Determine whether it’s possible to draw two parallel原创 2017-09-02 22:28:20 · 437 阅读 · 0 评论 -
Dropping water balloons UVA - 10934 (奇怪的dp,思维题)
It’s frosh week, and this year your friends have decided that they would initiate the new computer science students by dropping water balloons on them. They’ve filled up a large crate of identical原创 2017-09-29 21:23:34 · 331 阅读 · 0 评论 -
Painting Eggs CodeForces - 282B (思维题)
The Bitlandians are quite weird people. They have very peculiar customs.As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. to do the原创 2017-11-29 23:11:59 · 367 阅读 · 0 评论 -
Dima and Sequence CodeForces - 272B (思维题)
Dima got into number sequences. Now he’s got sequence a1, a2, …, an, consisting of n positive integers. Also, Dima has got a function f(x), which can be defined with the following recurrence:f(0) = 0;原创 2017-11-30 12:54:44 · 531 阅读 · 0 评论 -
HDU 4747 Mex(线段树+思维题)
Problem Description Mex is a function on a set of integers, which is universally used for impartial game theorem. For a non-negative integer set S, mex(S) is defined as the least non-negative integer原创 2017-12-08 22:40:44 · 878 阅读 · 0 评论 -
HDU 4776 Ants(字典树+优先队列+思维题)
Problem Description There are some apple trees in a farm. An apple tree can be described as a connected graph which has n nodes and n-1 edges. The apples are the nodes and the branches are the edges原创 2017-12-12 00:06:07 · 394 阅读 · 0 评论 -
bzoj 3747: [POI2015]Kinoman (线段树+预处理)
Description共有m部电影,编号为1~m,第i部电影的好看值为w[i]。 在n天之中(从1~n编号)每天会放映一部电影,第i天放映的是第f[i]部。 你可以选择l,r(1<=l<=r<=n),并观看第l,l+1,…,r天内所有的电影。如果同一部电影你观看多于一次,你会感到无聊,于是无法获得这部电影的好看值。所以你希望最大化观看且仅观看过一次的电影的好看值的总和。 Input第一行两个整原创 2017-12-12 18:59:22 · 314 阅读 · 0 评论 -
HDU 5776 sum(思维题+前缀和)
Problem Description Given a sequence, you’re asked whether there exists a consecutive subsequence whose sum is divisible by m. output YES, otherwise output NOInput The first line of the input has an原创 2017-12-06 11:21:00 · 488 阅读 · 0 评论 -
2017北京网络赛 hihocoder 1580 Matrix (dp很好的思维题)
时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 Once upon a time, there was a little dog YK. One day, he went to an antique shop and was impressed by a beautiful picture. YK loved it very much.However, YK di原创 2017-11-28 00:34:13 · 320 阅读 · 0 评论 -
hdu 6186 CS Course (前缀+后缀)
Problem Description Little A has come to college and majored in Computer and Science.Today he has learned bit-operations in Algorithm Lessons, and he got a problem as homework.Here is the problem:You原创 2017-09-22 22:05:28 · 324 阅读 · 0 评论 -
K.Bro Sorting HDU - 5122 (思维题)
Matt’s friend K.Bro is an ACMer. Yesterday, K.Bro learnt an algorithm: Bubble sort. Bubble sort will compare each pair of adjacent items and swap them if they are in the wrong order. The process repeat原创 2017-09-05 16:07:08 · 394 阅读 · 0 评论 -
2017 华东师范大学网赛 F 丽娃河的狼人传说
丽娃河是华师大著名的风景线。但由于学校财政紧缺,丽娃河边的路灯年久失修,一到晚上就会出现走在河边要打着手电的情况,不仅非常不方便,而且影响安全:已经发生了大大小小的事故多起。方便起见,丽娃河可以看成是从 1 到 n 的一条数轴。为了美观,路灯只能安装在整数点上,每个整数点只能安装一盏路灯。经专业勘测,有 m 个区间特别容易发生事故,所以至少要安装一定数量的路灯,请问至少还要安装多少路灯。Input第原创 2017-05-13 10:21:19 · 662 阅读 · 0 评论 -
Fibonacci Tree HDU - 4786 (并查集 生成树 思维题)
Problem Description Coach Pang is interested in Fibonacci numbers while Uncle Yang wants him to do some research on Spanning Tree. So Coach Pang decides to solve the following problem: Consider a原创 2017-05-05 21:56:10 · 351 阅读 · 0 评论 -
Civilization CodeForces - 455C (并查集+树的直径+推公式 +链式前向星存储边)
Problem DescriptionAndrew plays a game called “Civilization”. Dima helps him.The game has n cities and m bidirectional roads. The cities are numbered from 1 to n. Between any pair of cities there eithe原创 2017-05-07 18:19:36 · 321 阅读 · 0 评论 -
CodeM美团 初赛A轮 A题 身体训练
美团外卖的配送员用变速跑的方式进行身体训练。 他们训练的方式是:n个人排成一列跑步,前后两人之间相隔 u 米,每个人正常速度均为 v 米/秒。 当某个配送员排在最后的时候,他需要以当时自己的最高速度往前跑,直到超过排头的人 u 米,然后降回到原始速度 v 米/秒。每个人最初的最高速度为c[i] 米/秒,每轮衰减d[i] 米/秒,也就是说,如果i是第j个跑的,那么他的速度就是c[i]-(j-1)*原创 2017-06-19 00:14:44 · 1222 阅读 · 2 评论 -
CodeM美团 初赛A轮 C题 倒水
有一个大水缸,里面水的温度为T单位,体积为C升。另有n杯水(假设每个杯子的容量是无限的),每杯水的温度为t[i]单位,体积为c[i]升。 现在要把大水缸的水倒入n杯水中,使得n杯水的温度相同,请问这可能吗?并求出可行的最高温度,保留4位小数。 注意:一杯温度为t1单位、体积为c1升的水与另一杯温度为t2单位、体积为c2升的水混合后,温度变为(t1*c1+t2*c2)/(c1+c2),体积变为c1原创 2017-06-19 10:44:36 · 686 阅读 · 0 评论 -
Hexadecimal's Numbers CodeForces - 9C
One beautiful July morning a terrible thing happened in Mainframe: a mean virus Megabyte somehow got access to the memory of his not less mean sister Hexadecimal. He loaded there a huge amount of n dif原创 2017-08-19 21:12:46 · 1152 阅读 · 0 评论 -
Subset POJ - 3977 (折半枚举+lower_bound)
DescriptionGiven a list of N integers with absolute values no larger than 1015, find a non empty subset of these numbers which minimizes the absolute value of the sum of its elements. In case there are原创 2017-08-21 12:50:21 · 471 阅读 · 0 评论 -
hdu6185 Covering (递推+矩阵快速幂)
Problem Description Bob’s school has a big playground, boys and girls always play games here after school.To protect boys and girls from getting hurt when playing happily on the playground, rich boy B原创 2017-09-03 21:51:31 · 3170 阅读 · 5 评论 -
4 Values whose Sum is 0 POJ - 2785 (折半枚举)
The SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d ) ∈ A x B x C x D are such that a + b + c + d = 0 . In the following原创 2017-08-22 17:37:38 · 331 阅读 · 0 评论 -
朋友 HDU - 5963 (思维题)
Problem Description B君在围观一群男生和一群女生玩游戏,具体来说游戏是这样的: 给出一棵n个节点的树,这棵树的每条边有一个权值,这个权值只可能是0或1。 在一局游戏开始时,会确定一个节点作为根。接下来从女生开始,双方轮流进行 操作。 当一方操作时,他们需要先选择一个不为根的点,满足该点到其父亲的边权为1; 然后找出这个点到根节点的简单路径,将路径上所有边的权值翻转(即0变成原创 2017-08-27 17:01:26 · 403 阅读 · 0 评论 -
2017 acm icpc 上海final L 题(博弈)
emmmmm大致题意就是给你连续的n个格子,编号1到n,两个人轮流往空格子里放字母s或者o,谁先使得相邻的三个格子里字母为sos则谁获胜,假设A先手,B后手问谁会赢,如果所有格子都被填满了但是没有出现sos则认为两人平局。思路:一开始看到这题本来我想用状压啊,sg函数啊什么的去写,但是gg,于是就先扔一旁了,后来卡题的时候看榜单发现有一些奇奇怪怪的队伍过了这题,于是就觉得这题会不会是个傻逼题,然后对原创 2017-12-21 22:07:01 · 1544 阅读 · 0 评论