- 博客(95)
- 资源 (1)
- 收藏
- 关注
转载 Eclipse+CDT+MinGW
http://blog.csdn.net/xuhaipeng/article/details/3978721
2011-09-19 11:06:58
913
1
原创 HDU 3657 Game
http://acm.hdu.edu.cn/showproblem.php?pid=3657#includeusing namespace std;#define N 2550#define M 2000000#define inf 0x7fffffffstruct
2011-08-05 14:17:36
1762
2
原创 HDU 3277 Marriage Match III
http://acm.hdu.edu.cn/showproblem.php?pid=3277#includeusing namespace std;#define N 800#define M 1000000#define inf 0x7fffffffstruct
2011-08-03 21:04:26
1585
原创 HDU 3902 Swordsman
http://acm.hdu.edu.cn/showproblem.php?pid=3902额外加上每两个点的中点,把N个点扩展成2*N个,然后枚举1到n点,于其对面的点相连,当作对称轴,然后看这条线段两边成对的点的连线,是否于对称轴平分且垂直,不要忘了还要平分这个条件#
2011-08-03 12:00:30
1137
原创 HDU 3848 CC On The Tree
http://acm.hdu.edu.cn/showproblem.php?pid=3848#include#define N 10005using namespace std;#define inf 0x7fffffffstruct node{ int next,v,
2011-07-25 12:46:20
662
原创 HDU 2196 Computer
http://acm.hdu.edu.cn/showproblem.php?pid=2196#includeusing namespace std;#define N 10001struct node{ int next,v,w; node(){}; node(int
2011-07-25 11:35:16
1486
1
原创 HDU 3870 Catch the Theves
http://acm.hdu.edu.cn/showproblem.php?pid=3870最小割转最短路#include#includeusing namespace std;#include#define N 160001#define M 1500001#def
2011-07-23 19:54:51
1389
1
原创 poj 2773 Happy 2006
http://poj.org/problem?id=2773#includeusing namespace std;#define N 1001bool h[N*N],flag[N*N];int prime[N],cnt;void init(){ memset(h,f
2011-07-22 20:58:04
722
原创 HDU 3848 CC On The Tree
http://acm.hdu.edu.cn/showproblem.php?pid=3848#include#include#include#include#include#define N 10001using namespace std;struct node{
2011-07-21 10:47:02
1036
原创 HDU 2993 MAX Average Problem 斜率优化
http://acm.hdu.edu.cn/showproblem.php?pid=2993#includeusing namespace std;#define N 100005double sum[N];int n,k;int q[N],head,tail;voi
2011-07-21 10:11:12
1110
原创 HDU 3530 Subsequence
http://acm.hdu.edu.cn/showproblem.php?pid=3530#includeusing namespace std;#define N 100005int q_max[N],head_max,tail_max;int q_min[N],he
2011-07-20 15:38:54
929
原创 HDU 3276 Star
http://acm.hdu.edu.cn/showproblem.php?pid=3276/*题目给出了值的范围,可以二分一下答案,对每一个二分的均值,将原先序列每一个都减去这个均值,假设这个均值可以达到,那么一定可以找到两个不连续的区间,它们的和大于等于0.....这样
2011-07-20 09:34:49
923
原创 HDU 3861 The King’s Problem
http://acm.hdu.edu.cn/showproblem.php?pid=3861#include#includeusing namespace std;#define N 5005#define M 100005int top,bcnt;int stac
2011-07-19 19:55:38
1632
4
原创 HDU 3849 By Recognizing These Guys, We Find Social Networks Useful
http://acm.hdu.edu.cn/showproblem.php?pid=3849#includeusing namespace std;#include#include#include#include#include#define N 10005#de
2011-07-18 18:22:19
1342
原创 hdu 1011 Starship Troopers
http://acm.hdu.edu.cn/showproblem.php?pid=1011#includeusing namespace std;#define N 101int w[N],val[N];int dp[N][N];int n,m;struct nod
2011-07-18 13:25:34
1091
原创 HDU 1516 The more, The Better
http://acm.hdu.edu.cn/showproblem.php?pid=1561#include#includeusing namespace std;#define N 201vector E[N];int dp_temp[N][N],dp[N][N];
2011-07-17 15:47:01
893
原创 HDU 3594 Cactus 仙人掌
http://acm.hdu.edu.cn/showproblem.php?pid=3594#includeusing namespace std;#define N 20005#define M 50005int top;int stack[N],index;bo
2011-07-17 13:04:34
1294
原创 HDU 3639 Hawk-and-Chicken 支持传递
http://acm.hdu.edu.cn/showproblem.php?pid=3639#include#include#include#includeusing namespace std;#define N 5005#define M 30005int to
2011-07-17 10:19:40
1130
原创 HDU 1520 Anniversary party
http://acm.hdu.edu.cn/showproblem.php?pid=1520#includeusing namespace std;#define N 6001struct node{ int father; int child; int brothe
2011-07-16 19:49:31
868
原创 HDU 1435 Stable Match
http://acm.hdu.edu.cn/showproblem.php?pid=1435#include#include#include#include#include#include#includeusing namespace std;#define N
2011-07-13 19:10:07
1581
原创 HDU 3832 Earth Hour
http://acm.hdu.edu.cn/showproblem.php?pid=3832#include#include#include#includeusing namespace std;#define N 205#define M 400005#defin
2011-07-13 10:28:18
960
原创 HDU 2653 Waiting ten thousand years for Love
http://acm.hdu.edu.cn/showproblem.php?pid=2653#include#includeusing namespace std;#define N 81bool h[N][N][N];int dir[4][2]={-1,0,0,-1,
2011-07-08 10:41:00
993
转载 欧拉函数(转)
相关题目: http://acm.hdu.edu.cn/showproblem.php?pid=2824 pku 2478(与前n个数互质的个数的求和) http://acm.hdu.edu.cn/showproblem.php?pid=3508 素因子的积 http://
2011-07-07 15:28:53
717
原创 杂
#includeusing namespace std;#define N 1000001struct node{ double x,y;}p[N];int n;void cal_c(){ node u,v; double area=0,tx
2011-07-06 14:41:02
416
原创 HDU 2768 Cat vs. Dog
http://acm.hdu.edu.cn/showproblem.php?pid=2768#includeusing namespace std;#define N 505#define M 10001struct node{ int next,v
2011-07-05 19:45:42
1098
原创 HDU 1507 Uncle Tom's Inherited Land*
http://acm.hdu.edu.cn/showproblem.php?pid=1507#includeusing namespace std;#define N 10001struct node{ int next,v; node(){};
2011-07-05 18:08:13
783
原创 HDU 1962 Card Game Cheater
http://acm.hdu.edu.cn/showproblem.php?pid=1962#include#includeusing namespace std;#define N 60#define MM N*Nstruct node{ int
2011-07-05 18:06:56
1194
原创 HDU 2482 Transit search
http://acm.hdu.edu.cn/showproblem.php?pid=2482#include#include#include#include#includeusing namespace std;#define N 5050#de
2011-07-05 11:33:29
1610
2
原创 HDU 3191 次短路 How Many Paths Are There
http://acm.hdu.edu.cn/showproblem.php?pid=3191#include#include#define N 55#define M 10000#define inf 0x7fffffffusing namespac
2011-07-04 21:34:56
1591
原创 HDU 2722 Here We Go(relians) Again
http://acm.hdu.edu.cn/showproblem.php?pid=2722#include#includeusing namespace std;#define N 450#define M 10000#define inf 0x7
2011-07-03 19:09:40
994
原创 HDU 3367 Pseudoforest
http://acm.hdu.edu.cn/showproblem.php?pid=3367#includeusing namespace std;#include#define N 10001#define M 100001int bin[N];
2011-07-03 12:16:26
881
原创 HDU 3450 Counting Sequences
http://acm.hdu.edu.cn/showproblem.php?pid=3450#include#includeusing namespace std;#define mod 9901#define N 100005int a[N],b[
2011-07-03 10:55:32
946
原创 AC自动机加矩阵
#include#include#include#includeusing namespace std;#define N 35#define M 26#define FF(i,n) for(int i=0;i<n;i++)int tree[N][M];int Node;int fail[N];bool isword[N];int index[N];void init()
2011-07-03 09:03:23
458
原创 RMQ
#include#include#includeusing namespace std;#define MAX(x,y) (x>y?x:y)#define N 200010int num[N],n;int m;int st[20][N];int tlog2[N];void ST(){ for(int i=1;i<=n;i++) st[0][i]=num[i];
2011-07-03 09:01:55
390
原创 HDU 2586 How far away ?
http://acm.hdu.edu.cn/showproblem.php?pid=2586#includeusing namespace std;#define N 40001#define M 201struct edge{ int next,v,w; edge(){}; edge(int a,int b,int c){ next=a;v=b;w=c;
2011-06-30 22:16:00
872
原创 HDU 2492 Ping pong
http://acm.hdu.edu.cn/showproblem.php?pid=2492#includeusing namespace std;#define N 100001#define M 20001__int64 c[N];int a[M];__int64 L[M],R[M];int lowbit(int x){ return x&(-x);}
2011-06-30 19:58:00
1016
原创 HDU 3231 Box Relations
http://acm.hdu.edu.cn/showproblem.php?pid=3231#includeusing namespace std;#define N 2001#define M 500000struct node{ int v,next; node(){}; node(int a,int b){ next=a;v=b; }}E[M];
2011-06-30 10:17:00
1950
poisson reconstruction
2018-09-05
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人