- 博客(13)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 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;iscanf("%d",&a[i]);for(i=1;iscanf("%d",&b[i
2014-02-28 18:27:39
456
原创 hdu 1269 求连通图的模板题
#include#include#include//只存在一个连通分量#includeusing namespace std;#define N 11000#define NN 110000struct node {//链表实现int v,next;}bian[NN];int sta[N];//数组模拟寨int top,dfn[N],low[N],yon
2014-02-28 17:40:01
485
原创 1827 tarjan+缩点
#include#include#include#include#include#includeusing namespace std;#define inf 1000000000#define N 2100vectorh[N];//stackq;///int dfn[N],low[N],index,indegree[N],a[N],visit[N],s
2014-02-28 17:13:44
478
原创 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];void addedge(int u,int v,int w) { bian[yo
2014-02-22 14:17:09
595
原创 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,m,yong,head[N];void cre
2014-02-20 13:22:48
489
原创 hdu 1874 dijkstra 队列实现 比数组高效特别在稀疏图
参考 http://blog.csdn.net/zhuyingqingfen/article/details/6370561刘汝佳白皮书#include#include#include#includeusing namespace std;#define N 2100#define inf 1000000000int n,m;struct node {
2014-02-19 21:14:05
620
原创 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 w) {bian[yong].u=u;bian[
2014-02-19 18:58:15
699
转载 Bellman-ford算法的学习http://blog.csdn.net/niushuai666/article/details/6791765
http://hi.baidu.com/qifeiyixue77/item/ca790fdbdcf683fb54347f81
2014-02-18 21:07:50
544
原创 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;ifor(j=0;jmap[i][j]=inf;while(m--) {scanf("%d%d",&i,
2014-02-17 20:15:56
464
原创 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--) {getchar(); gets(str);len
2014-02-17 18:56:51
654
原创 poj 2823 二分法+单调队列
#include#define N 1100000int minf[N],maxf[N],a[N],index[N];int mif(int f,int first,int end) {int mid;while(firstmid=(first+end)/2;if(minf[mid]==a[f])return mid;else if(minf[mid]>a[
2014-02-16 17:31:33
576
原创 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;i scanf("%d",&a[i]); minf[first]=
2014-02-16 16:37:57
517
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人