CODEVS钻石天梯
Streat思锥
光锥之内就是命运,思锥之外则是无垠
展开
-
CODEVS 1077多源最短路
#include<stdio.h>#include<iostream>using namespace std;int n,g[150][150],q;int main(){ scanf("%d",&n); for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) scanf("%d",&g[i][j]);原创 2016-11-07 12:48:26 · 259 阅读 · 0 评论 -
CODEVS 1231最优布线问题
#include<stdio.h>#include<iostream>#include<algorithm>using namespace std;int n,m,aa,bb,cc,cur=0,p[1000100],k=0;long long ans=0;struct node{ int u,v,value;}a[1000100];int cmp(struct node aa原创 2016-11-04 01:04:49 · 659 阅读 · 0 评论 -
CODEVS 1078最小生成树
#include<stdio.h>#include<iostream>#include<algorithm>using namespace std;int a,n,u[110000],v[110000],w[110000],r[110000],p[110000],ans;//注意!!!!!数组要开大!!!!!大大大!!!!!int cmp(const int i,const int j){原创 2016-11-03 23:07:41 · 353 阅读 · 0 评论 -
CODEVS 1073家族
#include<stdio.h>#include<iostream>using namespace std;int n,m,p,fa[5010],x,y,z; int find(int cur){ if(fa[cur]==cur) return cur; return fa[cur]=find(fa[cur]);}int main(){ freopen("107原创 2016-11-03 19:36:47 · 240 阅读 · 0 评论 -
CODEVS 1081线段树练习2
#include<stdio.h>#include<iostream>using namespace std;int n,f[400010],q,x,y,z;struct tree{ int left,right,value;//每个树节点所表示范围的左l右r和 叶节点的值 或 非叶节点的 flag<加的数> }a[400010];void build(int l,int r,i原创 2016-11-02 22:09:32 · 198 阅读 · 0 评论 -
CODEVS 1080线段树练习
#include<stdio.h>#include<iostream>using namespace std;int n,m,sum[400001],a[100010],x,y,z;int dfs(int o,int l,int r){//以sum数组构建线段树 int mid=(l+r)/2; if(l==r) return sum[o]=a[l]; else re原创 2016-11-01 22:31:17 · 244 阅读 · 0 评论 -
CODEVS 1230元素查找
解法一:STL set简单应用#include<cstdio>#include<iostream>#include<set>using namespace std;set<int> a;int m,n,x;int main(){ freopen("1230.in","r",stdin); freopen("1230.out","w",stdout); scanf(原创 2016-11-12 22:47:04 · 311 阅读 · 0 评论 -
CODEVS 1245最小的N个和
#include<stdio.h>#include<iostream>#include<queue>#include<algorithm>using namespace std;struct node{ int sum,bi; friend bool operator < (node aa,node bb){ return aa.sum>bb.sum;原创 2016-11-11 16:38:34 · 250 阅读 · 0 评论 -
CODEVS 1380没有上司的舞会
#include<stdio.h>#include<iostream>#include<vector>using namespace std;vector<int>sons[6010];int n,happiness[6010],father[6010],son,fa,f[6010][5];int mmax(int a,int b){ return a>b?a:b;}int原创 2016-11-11 10:50:00 · 259 阅读 · 0 评论 -
CODEVS 1052地鼠游戏
#include <iostream>#include <cstdio>#include <algorithm>#include <queue>#include <vector>#include <cstring>using namespace std;struct node{ int value,time; friend bool operator < (node a原创 2016-11-09 23:41:45 · 479 阅读 · 0 评论 -
CODEVS 1063合并果子
#include<cstdio>#include<algorithm>using namespace std;int n,a[10010],sum;int main(){ freopen("1063.in","r",stdin); freopen("1063.out","w",stdout); scanf("%d",&n); for(int i=1;i<=n;原创 2016-11-09 11:13:44 · 519 阅读 · 0 评论 -
CODEVS 1041Car的旅行路线
声明:源代码从iwtwiioi_2处转载,这是 原文链接 。我在此代码的基础上做进一步的说明解释。#include <iostream>#include <algorithm>#include <cstring>#include <iomanip>#include <cmath>using namespace std;const double oo = 10000000;//城市的飞机翻译 2016-11-08 21:13:52 · 513 阅读 · 0 评论 -
CODEVS 1079回家
#include<stdio.h>#include<iostream>using namespace std;int youniu[55],youdian[55],g[55][55],dis[55],book[55];int mmin,value,v,u,p;char a,b;const int inf = 1000000000;int main(){ freopen("107原创 2016-11-08 01:02:14 · 224 阅读 · 0 评论 -
CODEVS 1069关押罪犯
#include<stdio.h>#include<iostream>#include<algorithm>using namespace std;struct node { int u,v,value;}a[400000];int cmp(struct node aa,struct node bb){ return aa.value>bb.value;}int n,原创 2016-11-07 14:59:44 · 261 阅读 · 0 评论 -
CODEVS 1001舒适的路线
#include<stdio.h>#include<iostream>#include<algorithm>using namespace std;struct node{ int u,v,value;}a[50010];#define inf 1<<30int fa[50000],s,t,vmax=0,vmin=inf,n,m,k=0;int cmp(struct node原创 2016-11-04 14:20:27 · 377 阅读 · 0 评论