- 博客(26)
- 收藏
- 关注
RSS订阅原创 ZCMU 1902: Rhombinoes ( 二分图匹配)
1902: RhombinoesDescriptionRhombinoesIn the game of Rhombinoes, you have a board made up entirely of equilateral trianges (see the image), some of which are "live" and some are "dead". You
2017-03-29 16:08:01
900
转载 AVL
1123. Is It a Complete AVL Tree (30)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueAn AVL tree is a self-balancing
2017-02-22 13:27:54
309
转载 poj2550
DescriptionHarvard linguistics professor George Kingsley Zipf (1902-1950) observed that the frequency of the kth most common word in a text is roughly proportional to 1/k. He justified his observa
2017-02-07 16:03:45
300
转载 zcmu1781
1781: 上升序列数Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 8 Solved: 3[Submit][Status][Web Board]Description假设有一个数列1,4,5,6,6,7那么这个数列的严格上升子序列就是1,4,5,6,7。现在有一个数比如123，如果单独看123的每一位就是1,2,3，
2016-12-22 13:37:09
285
转载 ZCMU 1708 树状数组优化dp
1708: 上升子序列Time Limit: 1 Sec Memory Limit: 128 MBDescription有一个长度为n的数组，要你求出最长上升子序列？？？然而事实并没有那么难。infact,有一个长度为n的数组a，求出长度为m的上升子序列的个数。Input多组测试数据第一行输入一个n，m（m第二行输入数组a。1Output
2016-12-14 15:49:34
335
转载 hdu5950 矩阵构造
#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define LL long long#define cl(a,b) memset(a,b,sizeof(a))#define MAXN 7const
2016-12-08 20:08:36
189
转载 hdu5950 dfs
#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define ll long long#define cl(a,b) memset(a,b,sizeof(a))#define N 50005#defi
2016-12-08 16:19:54
168
转载 bfs hdu5965
#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define LL long long#define cl(a,b) memset(a,b,sizeof(a))#define maxn 100005#
2016-11-30 18:25:08
295
转载 斐波那契矩阵快速
#include#include#include#include#include#include#include#include#includeusing namespace std;#define LL long long#define maxn 100005const int N=2;const LL mod=1000000007;struct node{
2016-11-20 15:02:06
180
转载 简单bfs
Joe works in a maze. Unfortunately, portions of the maze havecaught on fire, and the owner of the maze neglected to create a fireescape plan. Help Joe escape the maze.Given Joe’s location in the
2016-11-17 21:22:17
194
转载 线段树入门单节点更新区间求最大值hdu1754
#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define LL long long#define cl(a,b) memset(a,b,sizeof(a))#define N 50005#defi
2016-11-12 20:44:56
204
转载 线段树 离散化 poj2528
题意 n（n 求出最后还能看见多少张海报。如输入 离散化只要记录1 4 2 6 8 10 7 3排序后为 1 2 3 4 6 7 8 101 2 3 4 5 6 7 8然后输入1 41~4=1 12 61=1 2~5=2 28 10 1=1 2~5=2 7~8=3 33 4
2016-11-02 15:50:45
203
转载 二维树状数组hdu2642
#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define ll long long#define cl(a,b) memset(a,b,sizeof(a))#define N 50
2016-11-01 16:59:37
243
原创 树状数组poj2481
#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define ll long long#define cl(a,b) memset(a,b,sizeof(a))#define N 50005#defi
2016-11-01 15:36:07
156
转载 hdu1007求最近点对(分治法)
#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define ll long long#define cl(a,b) memset(a,b,sizeof(a))#define N 50
2016-10-24 15:51:50
187
转载 用kruskal方法做的
hdu1875 #include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define ll long long#define cl(a,b) memset(a,b,sizeof(a))#define N
2016-10-23 13:13:04
185
转载 Dijkstra 最短路径
hdu1874 #include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define ll long long#define cl(a,b) memset(a,b,sizeof(a))#define N 5
2016-10-22 15:03:12
174
转载 卡特兰数
#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define LL long long#define N 1000000009#define cl(a,b) memset(a,b,sizeof(a))int a[105
2016-10-20 20:39:20
168
转载 状态压缩
dp[i][j] i表示用二进制表示有几个点如：5=101 表示0，2点存在1点不存在 题目中j表示存在点的时候奖励为多少。if(i&(1集点i包括点ji=(i|(1把点j加入到集点i中去i=(i-(1把点j从集点i中删去//zcmu1552#include#include#include#include#include#include#incl
2016-10-18 15:39:03
182
转载 ZCMU1551
一列一列考虑 dp[i][j][3], 后面3个表示从什么方向进入这个点 假设现在的点为（i,j）从左边进入的话要考虑点（i,j-1）的情况，取该点左，上，下的最大值dp[i][j][left]=max(dp[i][j-1][left],dp[i][j-1][up],dp[i][j-1][down])+a[i][j];从上面进入的话要考虑点（i-1,j）的情况
2016-10-13 17:34:27
206
转载 数位DP
//hdu3555 solve函数写到主函数里就错了 不知道为什么 - -！#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define ll long long#define cl(a,b) mems
2016-09-29 15:47:24
152
转载 dp
把字符串折半，分成0 - n/2-1 和 n/2 - n-1 dp[i][j] 表示 第i位及之后的总代价为j可不可行 从第 n/2-1 位推回第 0 位， 若dp[0][m] = 1，则存在 然后贪心对每一位从'a'试到'z'，选取接下来存在解的字符hdu5903#include#include#include#include#inclu
2016-09-28 10:57:37
175
转载 数位dp
//hdu2089#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define ll long long#define cl(a,b) memset(a,b,sizeof(a))#define N 50
2016-09-23 13:16:54
174
转载 c语言 组合数学+大数取模
//hdu5894#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define LL long long#define N 1000000009#define cl(a,b) memset(a,b,sizeof(a))
2016-09-21 15:06:52
997
转载 补图求最短路bfs
//hdu5876#include#include#include#include#include#include#include#include#includeusing namespace std;#define PI acos(-1)#define lson i<<1,l,mid#define rson i<<1|1,mid+1,r#define cl(a,b) m
2016-09-15 14:23:42
268
转载 线段树
#include#include#include#include#include#include#includeusing namespace std;#define PI acos(-1)#define inf 1e9#define lson i<<1,l,mid#define rson i<<1|1,mid+1,rint sum[300005],val[100005];
2016-09-05 13:26:23
152
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人