hdu
qq_36054450
这个作者很懒,什么都没留下…
展开
-
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 · 186 阅读 · 0 评论 -
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 · 993 阅读 · 0 评论 -
数位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 · 173 阅读 · 0 评论 -
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 · 174 阅读 · 0 评论 -
数位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 阅读 · 0 评论 -
卡特兰数
#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 · 167 阅读 · 0 评论 -
用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 · 165 阅读 · 0 评论 -
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 · 185 阅读 · 0 评论 -
线段树 离散化 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 · 200 阅读 · 0 评论 -
线段树入门单节点更新区间求最大值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 · 200 阅读 · 0 评论 -
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 阅读 · 0 评论 -
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 · 165 阅读 · 0 评论 -
补图求最短路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 · 250 阅读 · 0 评论