2015年03月_Amon-

原创 (121E)codeforce

#include#include#include#include#include#include#include#include#include#include#define ll __int64#define lll unsigned long long#define MAX 1000009#define eps 1e-8#defi

2015-03-27 21:29:22 507

原创 (10D)codeforce

题意：LCIS裸题，只不过要求输出路径。。#include#include#include#include#include#include#include#include#include#include#define LL __int64#define lll unsigned long long#define MAX 1000009#define eps 1e-8

2015-03-27 21:27:40 312

原创 (216B)codeforce

题意：让你安排队伍，给你相互对立的关系，这些关系的人不能在一个队，然后尽量分成两个人数相同的队伍解法：并查集，判断环，如果是奇数环，减1就好。。然后就没了#include#include#include#include#include#include#include#include#include#include#define LL __int64#define l

2015-03-27 21:24:11 420

原创 (2604)HDU

#include#include#include#include#include#include#include#include#include#include#define ll __int64#define lll unsigned long long#define MAX 1000009#define eps 1e-8#define INF 0xfffffff

2015-03-27 21:23:58 338

原创 (1556)HDU

#include#include#include#include#include#include#include#include#include#include#define ll __int64#define lll unsigned long long#define MAX 100009#define eps 1e-8#defin

2015-03-24 15:45:48 355

原创 (2155)POJ

#include#include#include#include#include#include#include#include#include#include#define ll __int64#define lll unsigned long long#define MAX 1009#define eps 1e-8#define

2015-03-24 15:24:19 430

原创 (1166)HDU

#include#include#include#include#include#include#include#include#include#include#define ll __int64#define lll unsigned long long#define MAX 50009#define eps 1e-8#define

2015-03-24 14:23:59 380

原创 (1182)POJ

#include#include#include#include#include#include#include#include#include#include#define ll __int64#define lll unsigned long long#define MAX 1000009#define eps 1e-8#defi

2015-03-24 13:46:36 445

原创 (2035)SCU

#include#include#include#include#include#include#include#include#include#include#define ll __int64#define lll unsigned long long#define MAX 10009#define eps 1e-8#define

2015-03-23 18:55:47 476

原创判断MST是否唯一

#include#include#include#include#include#include#include#include#include#include#define ll __int64#define lll unsigned long long#define MAX 10009#define eps 1e-8#define

2015-03-19 19:22:48 3954

原创 (1183)SCU

题意：这里先吐槽下题意，看了好久没看明白，偷偷百度的才知道题意，一共有n个人，男生和女生之间呢有恋爱关系。给你一系列恋爱的关系，但是你不知道谁是男生谁是女生。问你求一个集合，这个集合中的人不存在恋爱关系，求最大人数。解法：二分图匹配，把最大的恋爱关系对数求出来，然后除以2，因为1-2,2-1，被算作2组，实际是一组，所以用总人数减去恋爱人数就是不存在恋爱关系的集合。如果还是不明白看这里

2015-03-19 18:14:41 454

原创 (2312)POJ

题意：问你能否从R走到T，如果能，就算最小的步数解法：BFS+记忆化搜索，设置一个数组存下当前位置的最小步数，最后返dp[x][y],x y为T的坐标即可#include#include#include#include#include#include#include#include#include#include#include#define ll __int64#def

2015-03-19 18:08:15 353

原创并查集的两种写法

今天写了krusal模板，发现图论书上有另一种并查集的写法。今天整理一下，写出来。第一种，相对传统的写法：int father[MAX];int Find(int x){ if (father[x]!=x) father[x]=Find(father[x]); return father[x];}void init(){

2015-03-17 18:36:40 1365

原创 (1649)ZOJ

#include#include#include#include#include#include#include#include#include#include#include#define ll __int64#define lll unsigned long long#define MAX 1000009#define eps 1

2015-03-17 13:56:46 503

原创 (1231)lightOJ

In a strange shop there are n types of coins of value A1, A2 ... An. C1, C2, ... Cn denote the number of coins of value A1, A2 ... An respectively. You have to find the number of ways you can make K

2015-03-16 17:14:55 449

原创 (1096)lightOJ

DescriptionYou have to find the nth term of the following function:f(n) = a * f(n-1) + b * f(n-3) + c, if(n > 2)= 0, if(n ≤ 2)InputInput starts with an integer T (≤ 100), denoting the number of t

2015-03-16 17:10:24 310

原创 (5184)HDU

#include#include#include#include#include#include#include#include#include#include#define LL __int64#define lll unsigned long long#define MAX 1000009#define eps 1e-8#

2015-03-15 15:31:04 464

原创 (3926)HDU

#include#include#include#include#include#include#include#include#include#include#define ll __int64#define lll unsigned long long#define MAX 1000009#define MAXN 10009

2015-03-13 20:51:17 456

原创 (1224)HDU

#include#include#include#include#include#include#include#include#include#include#define ll __int64#define lll unsigned long long#define MAX 1000009#define eps 1e-8#

2015-03-13 11:19:56 397

原创 (3635)HDU

题意：有两个操作，问你每次操作后，问你询问点的位置，位置有多少点，以及这个点被移动了多少次。想法；并查集#include#include#include#include#include#include#include#include#include#include#define ll __int64#define lll unsi

2015-03-12 20:17:30 407

原创 (2546)HDU

题意：问你余额何时最小想法：首先排列，找出最大的菜价，用5-最大的菜价，就可以保证余额最小，剩下的体积用0-1背包，尽量的装满。#include#include#include#include#include#include#include#include#include#include#define ll __int64#def

2015-03-12 20:16:23 341

原创 (1217)HDU

题意：给你n种货币，问你能否使汇率大于1.想法：floyd#include#include#include#include#include#include#include#include#include#include#define ll __int64#define lll unsigned long long#define

2015-03-12 20:11:03 341

原创 (1010)HDU

题意：在N*M的图下。问你从S到D是够可以到达在第T秒的时候解决方法：DFS注意：两次剪枝 #include#include#include#include#include#include#include#include#include#include#define ll __int64#define lll unsigned lon

2015-03-10 21:13:38 320

原创 (1157)POJ

题意：有n种花，每种花有m个价值，给你一个n*m的图，让你选n种花，每种选一个，并保证当前的选的数的列大于前面所选数的列，这种选法下，价值最大。#include#include#include#include#include#include#include#include#include#include#define ll __int64#define ll

2015-03-10 12:25:34 343

LCIS题，最开始的时候以为是最长回文子串，一顿百度，一顿改，WA····，后来百度到题解···，剁手，是LCIS，也就是最长公共上升子序列，我们最开始的想法呢，首先，根据回文串来说，我们以前做过一个类似的DP题，把一个字符串，跟自己的反串求LCS的话，就是最长的子串，我们应用类似的想法，让数组跟自己的反数组，求LCIS，在这里我们注意一下，这个LCIS可能是奇数个，也可能是偶数个，所以我们在求L

2015-03-08 15:17:00 346

原创 (3615)POJ

又跟大一混题玩。。floyd简单的应用，有一个牛，他要从A跳到B，并且是A-B之间的高度差，所以B不能跳到A，这里是一个点，然后，问你，A-B之间最短距离当中，最大的高度差是多少。只要是把题意弄明白就可以了。#include#include#include#include#include#include#include#include#include#include

2015-03-08 15:11:14 395

原创 new life

今天是回到学校的第一天，感觉很多东西都变得有些不是那么的认识了。新的赛季开始了，又是开始准备自己的生活,new life，也许一个弱者总是喜欢重新开始，因为觉得很多的东西，都会公平的从零开始，thanks god ，给了我一个new begin 的权利。新赛季，新开始，come on，dear Amon

2015-03-08 12:57:11 374

Amon