2017年03月_丿残念灬

12月 10月 08月 07月 06月 05月 04月 03月 02月 01月

原创 Codeforces-788A Functions again(dp)

A. Functions againtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSomething happened in Uzhlyandia again...

2017-03-31 23:35:33 1042

原创 Codeforces-788B Weird journey（计数/欧拉回路）

B. Weird journeytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle boy Igor wants to become a travelle

2017-03-31 22:27:43 1036

原创 Codeforces-792E Colored Balls(贪心/数学)

E. Colored Ballstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n boxes with colored balls on the

2017-03-31 20:03:00 806

原创 BZOJ-2597 [Wc2007]剪刀石头布(费用流)

2597: [Wc2007]剪刀石头布Time Limit: 20 Sec Memory Limit: 128 MBSec Special JudgeSubmit: 1146 Solved: 538[Submit][Status][Discuss]Description在一些一对一游戏的比赛（如下棋、乒乓球和羽毛球的单打）中，我们经常会遇到A胜过B，B胜过C而C又胜过

2017-03-23 20:53:48 600

原创 CSU-1835 Pry Sequence Transformation(DP)

1835: Pry Sequence TransformationSubmit Page Summary Time Limit: 2 Sec Memory Limit: 128 Mb Submitted: 90 Solved: 22 DescriptionHaving solved the edit distan

2017-03-21 18:10:36 503

原创 CSU-1839 Who Feels Lucky(数形结合)

1839: Who Feels LuckySubmit Page Summary Time Limit: 1 Sec Memory Limit: 128 Mb Submitted: 54 Solved: 16 DescriptionFred, one of the smartest prisoners, real

2017-03-21 17:06:39 248

原创 CSU-1848 3-sided dice(计算几何)

1848: 3-sided diceSubmit Page Summary Time Limit: 1 Sec Memory Limit: 128 Mb Submitted: 42 Solved: 5 Description　　Just like every fall, the organizers of the

2017-03-21 16:50:11 1173

原创 CSU-1849 Comparing answers(矩阵)

1849: Comparing answersSubmit Page Summary Time Limit: 10 Sec Memory Limit: 128 Mb Submitted: 11 Solved: 6 DescriptionIn a place in Southwestern Europe, the

2017-03-21 16:31:31 364

原创 CSU-1837 Tree Count(树的同构)

1837: Tree CountSubmit Status Time Limit: 5 Sec Memory Limit: 256 Mb Submitted: 61 Solved: 18 DescriptionA tree T = (V, E), where V = {v1, v2,…, vn} is a s

2017-03-16 00:49:46 773

原创 CSU-1818 Crusher’s Code(期望dp)

1818: Crusher’s CodeSubmit Status Time Limit: 20 Sec Memory Limit: 256 Mb Submitted: 24 Solved: 15 Description Wesley Crusher is the teaching assistant fo

2017-03-16 00:35:04 448

原创 POJ-1160 Post Office(dp+四边形不等式)

I - Post Office POJ - 1160 题意：有N个村庄，坐标Xi依次递增，现在将P个邮局分别建在村庄中，要求所有村庄到最近的邮局的距离最近，问距离之和为多少题解：普通dp对于区间[i,j]，如果要放一个邮局，那么一定是放在最中间是最优的设dp[i][j]为一共有i个村庄，且已建了j个邮局;w[i][j]表示区间[i,j]内放一个邮局的花费

2017-03-01 16:59:38 412

原创 HDU-3516 Tree Construction(区间dp+四边形优化)

H - Tree Construction HDU - 3516 /*题意：有N个点，每个点的坐标为(Xi,Yi),对于jYk,现在用只能向上或向右走的线将所有点连接成一棵树，点为树的叶，问线的最小长度题解：区间dp+四边形不等式优化对于[i,j]可被分成[i,k]和[k+1,j]假设区间[i,k]和[k+1,j]分别连成了一棵树，那么只要在用长度w

2017-03-01 16:45:14 710

原创四边形不等式优化

当函数w(i,j)满足 w(a,c)+w(b,d)<=w(b,c)+w(a,d) 且a<=b<c<=d 时，我们称w(i,j)满足四边形不等式。当函数w(i,j)满足 w(i',j)<=w(i,j')且 i<=i'<j<=j' 时，称w关于关于区间包含关系单调。s(i,j)=k是指m(i, j)这个状态的最优决策最优代价d[i,j]=min{d[i,...

2017-03-01 16:42:27 391

从《Cash》谈一类分治算法的应用

本文将从今年NOI的一道动态规划问题Cash开始谈如何利用分治思想来解决一类与维护决策有关的问题

2018-06-04

空空如也

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

TA关注的人