- 博客(30)
- 收藏
- 关注
RSS订阅转载 博客搬家了
博客搬家了博客搬家了博客搬家了 重要的事说三遍 http://blog.csdn.net/dale_zero 转载于:https://www.cnblogs.com/brotherHaiNo1/p/8613651.html
2018-03-20 23:35:00
83
转载 (HDU 4293) Groups (区间DP)
Groups Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1959Accepted Submission(s): 774 Problem Description After the regional cont...
2018-03-07 22:59:00
122
转载 (POJ 3169) Layout(差分约束系统)
Layout Time Limit:1000MS Memory Limit:65536K Total Submissions:13312 Accepted:6391 Description Like everyone else, cows like to stand close to their friends wh...
2018-03-06 20:50:00
111
转载 （POJ 2976）Dropping tests（01分数规划）
Dropping tests Time Limit:1000MS Memory Limit:65536K Total Submissions:15100 Accepted:5274 Description In a certain course, you takentests. If you getaio...
2018-03-05 23:01:00
90
转载 （HDu 4283）You Are the One（区间DP）
You Are the One Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4835Accepted Submission(s): 2306 Problem Description The TV shows ...
2018-03-04 10:56:00
107
转载 （HDU 5900）QSC and Master（区间DP）
Problem Description Every school has some legends, Northeastern University is the same.Enter from the north gate of Northeastern University，You are facing the main building of Northeastern Unive...
2018-03-03 23:46:00
88
转载 （HDU 5115）Dire Wolf（区间DP）
Dire Wolf Time Limit: 5000/5000 MS (Java/Others)Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 3071Accepted Submission(s): 1817 Problem Description Dire wolves, also k...
2018-03-03 21:11:00
87
转载 （HDU 1698） Just a Hook（线段树）-附通用模板
Just a Hook Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 37787Accepted Submission(s): 18409 Problem Description In the game of Do...
2018-03-03 14:20:00
85
转载 (HDU 1695)GCD(容斥+莫比乌斯反演)
GCD Time Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13721Accepted Submission(s): 5233 Problem Description Given 5 integers: a, b, c,...
2018-02-22 19:32:00
111
转载 (ZOJ 3329) One Person Game (概率DP)
There is a very simple and interesting one-person game. You have 3 dice, namelyDie1,Die2andDie3.Die1hasK1faces.Die2hasK2faces.Die3hasK3faces. All the dice are fair dice, so the pr...
2018-02-22 13:59:00
102
转载 Codeforces 933A (动态规划)
题目链接：http://codeforces.com/contest/934/problem/C 因为最后要找的是一段单调非减区间，所以最后形成的序列一定是11...12....22。中间有一个从1到2的断点。 现在要找一个区间反转，如果反转之后形成的序列的断点不在这个区间内，那么这次反转就没有任何意义，所以在dp区间里，断点必须包含在其中。 开一个三维数组dp[2010][...
2018-02-16 14:36:00
191
转载 （ZOJ 3822）Domination（概率DP）
Edward is the headmaster of Marjar University. He is enthusiastic about chess and often plays chess with his friends. What's more, he bought a large decorative chessboard withNrows andMcolumn...
2018-02-08 21:49:00
114
转载 （HDU 4405） Aeroplane chess （概率DP）
Problem Description Hzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws a dice(a dice have six faces with equ...
2018-02-08 17:40:00
59
转载 (HDU 3853) LOOPS (概率DP)
Problem Description Akemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).Homura wants to help her friend Madoka save the world. But because of the plot of the Boss Incubator, she is trapped...
2018-02-08 14:45:00
141
转载 (POJ 2096) Collecting Bugs(概率DP)
Description Ivan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, he classifies all pos...
2018-02-07 23:33:00
87
转载 （POJ 2151）Check the difficulty of problems（概率DP+容斥）
Description Organizing a programming contest is not an easy job. To avoid making the problems too difficult, the organizer usually expect the contest result satisfy the following two terms:1. A...
2018-02-05 22:48:00
108
转载 （POJ 3071）Football（概率DP）
有2^n个人进行比赛，所以可以推出比赛共需要进行n轮，单独考虑第n轮中序号为i的人需要面对的潜在对手，将这些对手分别考虑。 转移方程为dp[i][j]+=dp[k][j-1]*dp[i][j-1]*a[i][k];即晋级的概率=∑（自己来到这一轮的概率*对手来到这一轮的概率*战胜对手的概率） #include<iostream> #include<cst...
2018-02-04 21:46:00
88
转载 （POJ 3744）Scout YYF I（概率dp+矩阵快速幂）
概率dp入门题，转移方程为dp[i]=dp[i-1]*p+dp[i-2]*(1-p) 因为n个数字上限很大，所以常规的概率dp基本不可能，要用矩阵优化。 把路程分成n+1段，分别计算通过每段的成功率，即刚好跨越地雷的概率（dp[地雷x+1]） 算好每段之后把每段的成功率相乘。 （若有两颗地雷相邻那么成功率是0） #include<iostream> #incl...
2018-02-04 18:52:00
93
转载 矩阵快速幂模板
矩阵快速幂模板（手撸一遍，一下午修改的头要爆炸了！！！！！！！） 果然是菜原罪╮(╯▽╰)╭ #define N 20//根据需要自行修改 struct node { int n; double rect[N][N]; struct node operator* (const node b) { node tem;...
2018-02-04 18:46:00
63
转载 （POJ 1475） Pushing Boxes （BFS模拟）
Description Imagine you are standing inside a two-dimensional maze composed of square cells which may or may not be filled with rock. You can move north, south, east or west one cell at a step. ...
2018-01-22 17:25:00
153
转载 2017 ICPC沈阳站L
题意就不赘述了，方法就是按照给定的节点连接关系，任意选取一点建树。 要判断最后的交集中边的最大条数，遍历每一条边。因为题目保证是一棵树，所以去掉任意一条边都会变成两个不互相连通的连通分支。设这两个连通分支包含的点数均>=k,那么这条边就在最后的集合中，输出有多少条这样的边。 证明： 对于边a而言，如果它联通的两个图点数都>=k，在选择涂色方案的时候，就可以让这两个图都包...
2017-10-27 12:00:00
73
转载 （POJ 1990）Mowfest（确定不再来一发树状数组么？）
MooFest Time Limit:1000MS Memory Limit:30000K Total Submissions:8177 Accepted:3691 Description Every year, Farmer John's N (1 <= N <= 20,000) cows attend...
2017-08-09 13:57:00
56
转载 （POJ 3067） Japan （慢慢熟悉的树状数组）
Japan Time Limit:1000MS Memory Limit:65536K Total Submissions:29295 Accepted:7902 Description Japan plans to welcome the ACM ICPC World Finals and a lot of roa...
2017-08-08 21:35:00
141
转载 （POJ 2549）Sumsets（折半枚举）
Description Given S, a set of integers, find the largest d such that a + b + c = d where a, b, c, and d are distinct elements of S. Input Several S, each consisting of a line containing an int...
2017-08-08 13:06:00
200
转载 图的高siao存储结构——链式前向星
假期训练题好多啊，都没时间写博客了。。 （其实就是懒） 前几天jieba开了图论，好多新东西，一脸懵逼。。。 讲到链式前向星的时候还以为是星打错了，之后才具体了解。 现在会使用的图的存储方式有三种 1、邻接矩阵 对于数据不大的图，用这个方法存比较简明。开一个a【n】【n】的数组，可以记录联通情况或者权值（如果有权值的话） 2、邻接表 对于每个节点i，开一个vecto...
2017-08-01 12:14:00
107
转载 （HDU1317）XYZZY（Floyd+spfa）
XYZZY Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5804Accepted Submission(s): 1681 Problem Description It has recently been...
2017-08-01 11:44:00
87
转载 （POJ1182）食物链（带权并查集-附通用模板）
食物链 Time Limit:1000MS Memory Limit:10000K Total Submissions:74914 Accepted:22257 Description 动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。现有N个动物，以1－N编号。每个动物...
2017-07-27 23:30:00
89
转载 （HDU 1231）最大连续子序列
Description 给定K个整数的序列{ N1, N2, ..., NK }，其任意连续子序列可表示为{ Ni, Ni+1, ...,Nj }，其中 1 <= i <= j <= K。最大连续子序列是所有连续子序列中元素和最大的一个，例如给定序列{ -2, 11, -4, 13, -5, -2 }，其最大连续子序列为{ 11, -4, 13 }，最大和...
2017-07-21 09:46:00
91
转载 （HDU 1598） find the most comfortable road （并查集+最小生成树）
find the most comfortable road Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7532Accepted Submission(s): 3175 Problem Description...
2017-07-17 09:12:00
70
转载 Problem: The World Final II（NEUOJ1175）排序+动态规划
The World Final is coming! Next week our seniors, Brother Head, Little Bin and God Tan will fight for the glory of NEU. The rule of the world final is as follow: 1. if two teams have the di...
2017-06-22 13:46:00
118
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人