- 博客(28)
- 资源 (1)
- 收藏
- 关注
原创 Ural 1410
PRO IS HERE恶心的输入,注意input可能不止一行,所以。。。。我就是这么悲剧。#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i
2013-04-28 16:09:38 631
原创 Ural 1495
PRO IS HERE题目大意就是问是否存在长度小于31的仅有1,2组成的数,整除n。若有,输出最小的。dp[i] 表示模为i的最小的数。考虑(1#include#include#include#include#include#include#include#include#includeusing namespace std;#define
2013-04-28 14:27:59 696
原创 Ural 1513
PRO IS HERE题目大意就是将长度为n的全为1的数组,将其中某些1变为0,使得没有k个以上连续的1.dp[i][0] 表示第i位是0满足条件的个数dp[i][1] 表示第i位时1满足条件的个数dp[i][1] = dp[i-1][0] + dp[i-1][1]dp[i][0] = dp[i-k][1] + dp[i-k+1][1] +.... + dp[i
2013-04-28 10:51:56 664
原创 Ural 1427
PRO IS HERE描述:将一段文本分成最少的几段,全是由空格和字母组成的最长可拥有m个字符,否则最多含n个字符。求最少的段数。我们假设第一种方案是只存储空格和字母,第二种方案为其他。DP : dp[i][0] 表示到i这个点且这个点用的是第一种方案的最少的切段。 dp[i][1] 表示。。。。。。。。。。。。第二种方案。。。。。
2013-04-25 00:36:40 597
原创 Ural 1287
PRO IS HEREn*n矩阵,统计连续的横,竖,斜的'S' 和 's' 的个数的最大值,输出较大的那个。暴力dp#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a)
2013-04-24 23:57:32 579
原创 Ural 1346
PRO IS HERE将序列分成最少的段,每段都是非递减,或者非递增的。dp: dp[i][0] 表示到i点是非递增的划分数 dp[i][1] 表示到i点是非递减的划分数#include#include#include#include#include#include#include#includeusing namespace
2013-04-24 23:23:29 637
原创 Ural 1078
PRO IS HERE描述: n段线段,求最长的序列,使得后一条线段包含前一条线段。拓扑排序,然后dp。#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);
2013-04-24 22:26:52 557
原创 Ural 1501
PRO IS HERE dp[x][y][z] 表示s[0......x] ,t[0.......y] 之间0,1的个数之差为z-1(z=0,1,2)记忆化搜索就行了 #include#include#include#include#include#include#include#includeusing namespace std;
2013-04-23 23:40:51 542
原创 ural 1039
树型dp.#include#include#include#include#include#include#include#include#includeusing namespace std;#define PB push_back#define INS insert#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)#
2013-04-22 23:19:24 641
原创 ural 1244
PRO IS HERE简单的背包问题,输出yy一下就可以了。#include#include#include#include#include#include#include#includeusing namespace std;#define PB push_back#define INS insert#define FOR(i,a,b) for(i
2013-04-22 12:01:12 617
原创 Ural 1029
PRO IS HERE双向dp。#include#include#include#include#include#include#include#includeusing namespace std;#define PB push_back#define INS insert#define FOR(i,a,b) for(int (i)=(a);(i)
2013-04-22 11:12:00 521
原创 Ural 1658 Sum of Digits
PRO IS HERE0我用队列直接枚举(s1,s2) 是否可行。dp[s1][s2] 表示达到(s1,s2) 加的数,就是:s1 = S1 - dp[s1][s2] ,s2 = S2 - dp[s1][s2]^2No solution 打成 NO solution WA 了n次。。。#include#include#include#inclu
2013-04-22 00:26:00 561
原创 Ural 1003 Parity
PRO IS HERE大意:一段长度为n的路,已知m对信息,信息告诉你某两点之间的距离的奇偶,问你到哪个信息是错的。解答:明显的并查集,保存距离的奇偶,find的时候顺便跟新一下。。。我就是忘记了fa[x] = k查了n久的代码啊,弱菜就是弱啊。。。#include#include#include#include#include#i
2013-04-21 23:24:15 682
原创 NEERC 2005 Feel Good (Poj2976)
PRO IS HEREa[i] 最小的区间是固定的,可以用一个栈啊什么的求出左右比之小的第一个数的位置,而后就是模拟,但是我的代码过不了LA上HERE不知到时为什么。‘代码:#include#include#include#include#include#include#includeusing namespace std;#define
2013-04-19 21:46:13 1038
原创 SGU_271_Book_Pile
PRO IS HERE双端队列模拟过程即可,很像2013华中网络预赛的某题。。。好像是D#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)
2013-04-19 21:08:02 604
原创 NEERC 2004 Western Sub(spoj417 or poj 2970)
PRO IS HERE就是校赛的题目啊,有木有。。#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)#define nMax 101000
2013-04-18 22:25:20 852
原创 ZOJ 2674 Stange Limit
PROM IS HERE欧拉定理: a^b = a^(phi(m) + b%phi(m)) { mod m }#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);(i)<=(b)
2013-04-18 15:31:47 716 1
原创 CERC_2008_Tower(hdu 2971)
PRO IS HERE由 a(n) = 2*a(2)*a(n-1) - a(n-2)let p = 2*a(2);==>a(n) =p*a(n-1) - a(n-2)==>a(n)^2 = p^2*a(n-1)^2 - 2*p*a(n-1)*a(n-2) + a(n-2)^2................(1)let s(n) =sum(a(i) );s
2013-04-16 20:51:27 844
原创 Uva 10294 Arif in Dhaka (First Love Part 2)
PRO题目大意: n 个珠子组成的 项链,t 种颜色去染, 问有多少本质不同的项链;经旋转,翻转一样的视为同一种项链。就是一个简单的polya组合计数的应用,算出每种置换的循环节个数,答案就是《组合数学》 P393 的公式;因为题目的量比较小,直接暴搞就可以了,答案保证不会超64位,所以就没有必要高精度了。秀一下。。。
2013-04-15 11:02:45 769
原创 Uva 10288 - Coupons
自己写的正数分数类,也作为红书第一题,留念。。。alpc 加油。#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)#define nMax 1010#define inf 0x
2013-04-15 00:26:16 744
原创 ural 1036
PRO IS HERE一道比较简单的dp,比较恶心的是大数。。。直接python AC掉,好开心,纪念一下n,s=raw_input().split()n=int(n)s=int(s)if s%2 == 1: print 0else: s /= 2 b=[] b.append([]) a=[] for i in xrange(0,10): a
2013-04-11 22:55:37 777
原创 Ural 1018 树dp
PRO IS HERE树dp:#include#include#include#include#include#include#include#includeusing namespace std;#define PB push_back#define INS insert#define FOR(i,a,b) for(int (i)=(a);(i)<
2013-04-11 21:26:31 604
原创 Uarl 1303
PRO IS HERE其实只是简单的贪心即可,按(x,y) 排序,然后尽量取y大的。。。#include#include#include#include#include#include#include#includeusing namespace std;#define PB push_back#define INS insert#define FOR(
2013-04-11 20:39:47 589
原创 Ural 1741
#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define PB push_back#define INS insert#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)+
2013-04-11 02:13:26 540
原创 Ural 1117
YOU CAN SEE THE PRO HERE#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define PB push_back#define INS insert#define FOR(
2013-04-11 01:01:44 629
原创 Ural 1635
我是题目#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define PB push_back#define INS insert#define FOR(i,a,b) for(int (i)=(a);(i)
2013-04-10 23:47:23 614
原创 Ural 1635
#include#include#include#include#include#include#include#includeusing namespace std;#define PB push_back#define INS insert#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)#define nMax 10
2013-04-10 23:05:37 657
原创 Ural 1183
Click Me !#include#include#include#include#include#include#include#includeusing namespace std;#define nMax 201#define FOR(i,a,b) for(int (i) = (a) ;(i) <= (b) ; (i) ++)#define PB p
2013-04-08 12:17:39 722
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人