2013年08月_cqwelly

原创 poj 1466

#include #include #include #include #define N 510using namespace std;struct Node{ int v; int next;}edge[N*N];int head[N];void add_edge( int u, int v, int &i ){ edge[i].v = v;

2013-08-24 17:24:52 668

原创 hdu 3667

#include #include #include #include #include #define M 2000020#define N 550#define FOR(i,n) for(int i=0;i<n;i++)#define INF 0x7fffffffusing namespace std;struct Node{ int cost; i

2013-08-24 14:38:32 604

原创 poj 2195

#include #include #include #include #include #include #define MAXN 210#define MAXE 30010#define FOR(i_,a,b) for( int i_ = a; i_ <= b; i_ ++ )#define INF 0x7ffffffusing namespace std;struct

2013-08-21 16:12:20 632

原创 poj 2584

#include #include #include #include #define N 88404using namespace std;struct Node{ int v,next;}edge[N];int head[N], m, pre[N];bool mark[N];void add_edge( int u, int v, int &num ){

2013-08-21 16:08:21 666

原创 poj 2446

#include #include #include #include #define N 10010using namespace std;struct Point{ int x,y;}Q[N];struct Node{ int v,next;}edge[N*10];int pre[N], head[N], TN[33][33],tm[33][33];

2013-08-21 16:06:55 593

原创 hdu 3466

贪心+01背包#include #include #define N 500#define FOR(i,n) for(int i=0;i<n;i++)#define RFOR(i,a,b) for(int i=a;i>=b;i--)using namespace std;struct Node{ int p, q, val; bool operator <(cons

2013-08-20 21:15:57 523

原创 poj 1236

//1236#include #include #include #include #define N 110using namespace std;bool map[N][N];int s[N],s_n,low[N],stack[N],top,n,p[N];void dfs( int u, int dfs_num, int &scc_num){ low[u]=++dfs

2013-08-20 17:28:59 487

原创 hdu 2955

#include #include #include #include #include #define N 110#define FOR(i,a,b) for(int i=(a);i<=(b);i++ )#define FOR(i,n) for( int i=0;i<(n);i++ )#define RFOR(i,a,b) for(int i=(a);i>=(b);i-- )u

2013-08-20 17:17:55 495

原创 uva 562

#include #include #define N 102using namespace std;int a[N];bool dp[50002];int main(){ int cas, n,V,sum,i,j; scanf("%d",&cas); for(dp[0]=true; cas--; ) { sca

2013-08-20 13:17:46 620

原创 hdu 2639

#include #define N 102#define M 1002int a[N], b[N], k, heap[M][31], hsize[M],c[33];inline void merge(int a[], int an, int w, int b[], int &bn ){ int cn = 0, i=1, j=1, d=0; while( i<=an&&j

2013-08-20 10:06:00 661

原创 poj 2762

#include #include #include #define N 1010#define M 6060using namespace std;struct Node{ int v,next;}edge[M], edge2[M];int head[N], head2[N], SCC, num, top;int low[N], dfn[N], sta[N], sn[

2013-08-19 12:31:57 510

原创 uva 624

#include #include #include #include #define N 30using namespace std;int V, n, a[N], ans_sum, an, ans[N], b[N];void dfs( int u, int sum, int tn ){ if( sum > ans_sum ) { an = tn;

2013-08-18 12:13:09 611

原创 hdu 2089

#include #include #define N 8using namespace std;int dp[N][3],bit[N], bn;int get_ans( int x ){ int ans = 0, flag = 0; for( bn = 0;x; x/=10) bit[++bn] = x%10; bit[bn+1] = 0; for(

2013-08-11 11:48:10 438

原创 hdu 1698

#include #include #include #include #define N 400010#define L(rt) rt<<1#define R(rt) rt<<1|1#define LSON l,mid,L(rt)#define RSON mid+1,r,R(rt)#define MID (l+r)>>1#define FOR(i,n) for( int i

2013-08-09 17:30:57 520

原创 poj 3238

#include #include #include #include #include #define N 33using namespace std;int n, a[N][N], tmp[N][N], MOD, tp[N][N], one[N][N], ans[N][N], ta[N][N], i, j, k;void pow_matrix( int b[N][N], int

2013-08-06 18:35:52 768

原创 hdu 2896

//静态#include #include #include #include #include #define N 10010#define WORD_SIZE 128#define WORD_START 0using namespace std;class Node{public : int next[WORD_SIZE]; int count;

2013-08-06 11:21:47 501

原创 hdu 2222

#include #include #include #include #include #define N 1000010#define WORD_SIZE 26#define WORD_START 'a'using namespace std;class Node{public : int next[WORD_SIZE]; int count; i

2013-08-05 17:11:49 531

原创 hdu 4027

#include #include #include #include #include #include #define N 100010using namespace std;struct Node{ __int64 sum; int cur; bool is_low; bool is_leaf;}tree[N<<2];int n;in

2013-08-05 11:59:21 657

原创 poj3481

静态模板#include #include #include #include #include #define N 1000010using namespace std;class Node{public: int f; int l; int r; int vk; int vp;};class Splay{public:

2013-08-05 10:31:33 746

cqwelly的专栏