cqwelly的专栏

#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

#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

贪心+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

#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

#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(

#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;

学习资料背包九讲 http://wenku.baidu.com/view/519124da5022aaea998f0f22.htmlhttp://blog.youkuaiyun.com/woshi250hua/article/details/7636866#t0uva 624 CD http://uva.onlinejudge.org/index.php?option=com_onlineju