02 2014 档案

hdu 2602 简单0-1背包模板题
摘要：#include#include#define N 1100int dp[N];int main() {int n,t,m,a[N],b[N],i,j,v;scanf("%d",&t);while(t--) {scanf("%d%d",&n,&v);for(i=1;i=b[i];j--)if(dp[... 阅读全文
posted @ 2014-02-28 18:27 HYDhyd 阅读(126) 评论(0) 推荐(0)
hdu 1269 求连通图的模板题
摘要：#include#include#include//只存在一个连通分量#includeusing namespace std;#define N 11000#define NN 110000struct node {//链表实现int v,next;}bian[NN];int sta[N];//数组... 阅读全文
posted @ 2014-02-28 17:40 HYDhyd 阅读(145) 评论(0) 推荐(0)
1827 tarjan+缩点
摘要：#include#include#include#include#include#includeusing namespace std;#define inf 1000000000#define N 2100vectorh[N];//stackq;///int dfn[N],low[N],index... 阅读全文
posted @ 2014-02-28 17:13 HYDhyd 阅读(148) 评论(0) 推荐(0)
poj 1364 查分约束
摘要：#include#include#include#includeusing namespace std;#define inf 999999999#define N 300struct node { int u,v,w,next;}bian[N*10];int yong,n,head[N];voi... 阅读全文
posted @ 2014-02-22 14:17 HYDhyd 阅读(120) 评论(0) 推荐(0)
差分约束学习
摘要：http://www.cppblog.com/kerorohttp://blog.csdn.net/xuezhongfenfei/article/details/8685313 阅读全文
posted @ 2014-02-20 13:23 HYDhyd 阅读(115) 评论(0) 推荐(0)
poj 3159 差分约束
摘要：#include#include#include#includeusing namespace std;#define inf 1000000000#define N 31000#define NN 151000struct node {int u,v,w,next;}bian[NN];int n,... 阅读全文
posted @ 2014-02-20 13:22 HYDhyd 阅读(120) 评论(0) 推荐(0)
hdu 1874 dijkstra 队列实现 比数组高效特别在稀疏图
摘要：参考 http://blog.csdn.net/zhuyingqingfen/article/details/6370561刘汝佳白皮书#include#include#include#includeusing namespace std;#define N 2100#define inf 1000... 阅读全文
posted @ 2014-02-19 21:14 HYDhyd 阅读(118) 评论(0) 推荐(0)
1874 Bellman-ford算法 队列优化过的 用于稀疏图，有负权的图
摘要：#include#include#include#includeusing namespace std;#define N 2100struct node {int u,v,w,next;}bian[N];int n,m,yong,head[N];void creat(int u,int v,int... 阅读全文
posted @ 2014-02-19 18:58 HYDhyd 阅读(164) 评论(0) 推荐(0)
Bellman-ford算法的学习http://blog.csdn.net/niushuai666/article/details/6791765
摘要：http://blog.csdn.net/niushuai666/article/details/6791765 阅读全文
posted @ 2014-02-18 21:07 HYDhyd 阅读(130) 评论(0) 推荐(0)
hdu 1869 六度分离
摘要：#include#define N 200#define inf 300000int map[N][N];int main() {int i,j,n,m,k,f;while(scanf("%d%d",&n,&m)!=EOF) {for(i=0;imap[i][k]+map[k][j])map[i][... 阅读全文
posted @ 2014-02-17 20:15 HYDhyd 阅读(132) 评论(0) 推荐(0)
hdu 1073
摘要：#include#include#define N 5100char s[N][N],st[N][N],str[N],str1[N];int n;int main() {int i,j,lena,lenb,t,lea,leb,flag;scanf("%d",&t);while(t--) {getch... 阅读全文
posted @ 2014-02-17 18:56 HYDhyd 阅读(155) 评论(0) 推荐(0)
poj 2823 二分法+单调队列
摘要：#include#include#define N 1100000int a[N];int fmin[N],fmax[N];int tmin[N],tmax[N];int dicmax(int l,int r,int f[],int k) { int mid; while(l=f[mid])//... 阅读全文
posted @ 2014-02-16 17:31 HYDhyd 阅读(124) 评论(0) 推荐(0)
poj 2823 单调队列
摘要：#include#define N 1100000int minf[N],maxf[N],a[N],index[N];int main() {int n,i,k,first,end;while(scanf("%d%d",&n,&k)!=EOF) {first=end=0; for(i=0;iinde... 阅读全文
posted @ 2014-02-16 16:37 HYDhyd 阅读(117) 评论(0) 推荐(0)