- 博客(79)
- 收藏
- 关注
RSS订阅转载 Network Virtualization
http://networkheresy.com/2012/05/31/network-virtualization/Posted: May 31, 2012 | Author: networkheresy | Filed under: network virtualization, SDN | Tags: Network Virtualization |5 Comment
2013-03-01 11:00:28
471
原创 hdu1058
#include#include#include#include#include#define N 5842using namespace std;int dp[N];int a[4];int b[4];int c[4]={2,3,5,7};int main(){ int n,i,j,k; int t,mi; memset(a,0,sizeof(a)
2012-12-29 20:18:47
570
原创 hdu1069
#include#include#include#include#include#define N 40using namespace std;struct node{ int x,y,z; node(){} node(int x,int y,int z):x(x),y(y),z(z) {} bool operator < (const no
2012-12-26 23:50:51
391
原创 hdu1087
#include#include#include#include#include#include#define N 1010using namespace std;int a[N];int dp[N];int main(){ int n,i,j,ma,ma2; while(scanf("%d",&n)) { if(n==0)break;
2012-12-26 23:20:29
300
原创 zoj3516
#include#include#include#include#include#define N 10010using namespace std;int val[N];int parent[N];int head[N];int dp[N][10];struct node{ int i; int next;}nodes[N];int tot;void
2012-12-25 15:32:56
343
原创 poj1088
#include#include#include#include#include#include#define N 101using namespace std;int map[N][N];int dp[N][N];bool inq[N][N];int dir[2][4]={{0,0,1,-1},{1,-1,0,0}};struct node{ int x,y;
2012-12-24 22:38:03
243
原创 hdu1224
#include#include#include#include#include#include#include#define N 200using namespace std;bool map[N][N];bool inq[N];int interest[N];int dp[N];int father[N];void spfa(int n){ int i,j
2012-12-24 00:14:37
338
原创 zoj1666
#include#include#includeusing namespace std;int coin[]={1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289};int a[301];int ans[301];int main(){ int i,j,n; memset(ans,0,sizeof(ans)
2012-12-23 23:18:38
333
原创 zoj3471
#include#include#include#include#includeusing namespace std;int dp[2048];int map[12][12];int bin[]={0,1,2,4,8,16,32,64,128,256,512,1024};int main(){ int n,i,j,k; while(~scanf("%d",&n
2012-12-19 19:10:08
467
原创 poj1014
#include#include#include#include#includeusing namespace std;int dp[240010];int num[100];int cou;void insert(int n,int k){ int i,x,temp=0; for(i=1;;i=i<<1) { if(temp+i>n)b
2012-12-19 17:49:13
311
原创 zoj3171
#include#include#includeusing namespace std;char str[10005];int main(){ long long dp[5]; int n,i; while(~scanf("%s",str)) { memset(dp,0,sizeof(dp)); n=strlen(str)
2012-12-19 00:14:40
281
原创 poj1065
#include#include#include#include#include#include#define MAX 5010using namespace std;struct node{ int l,w; node(){}; node(int l,int w):l(l),w(w) {} bool operator <(const no
2012-12-18 23:44:11
682
原创 poj1631
#include#include#include#include#include#include#define MAX 40010using namespace std;int g[MAX];int main(){ int ca,n,x,i; int ans; scanf("%d",&ca); while(ca--) {
2012-12-18 00:13:13
777
1
原创 poj3628
#include#include#include#include#include#include#define MAX 2000100using namespace std;int dp[MAX];int cow[20];int main(){ int n,b,i,j; int m; int sum=0; while(~scanf("%d%d"
2012-12-17 23:42:43
658
原创 poj1458
#include#include#include#include#include#include#define MAX 300using namespace std;int dp[MAX][MAX];int main(){ string str1,str2; int i,j; while(cin>>str1) { cin>>str
2012-12-17 23:11:24
987
原创 poj1384
#include#include#include#include#includeusing namespace std;int w[10010];int p[10010];int main(){ int ca,n,weight,value,i,j,m; scanf("%d",&ca); while(ca--) { scanf("%d
2012-12-17 00:13:54
357
原创 hdu1248
#include#include#include#include#includeusing namespace std;int dp[10010];int a[]={150,200,350};int main(){ int n,t,i,j; scanf("%d",&n); while(n--) { memset(dp,0,sizeo
2012-12-16 23:43:00
308
原创 poj3624
#include#include#include#include#includeusing namespace std;int dp[12900];int w[3420],v[3420];int main(){ int n,weight; int i; while(~scanf("%d%d",&n,&weight)) { for(i
2012-12-16 23:20:57
1446
原创 zoj1108
#include#include#include#include#include#include#include#define MAX 1010using namespace std;struct mose{ int w,s,x; int len; mose(){}; mose(int w,int s,int x):w(w),s(s),x(x)
2012-12-16 23:05:29
857
原创 poj1050
#include#include#include#include#include#include#define MAX 101using namespace std;int mat[MAX][MAX];int sum[MAX];int maxval(int *a,int n){ int b=0,i; int s=a[0]; for(i=0;i<n;i+
2012-12-13 00:13:22
315
原创 zoj2136
#include#include#include#include#include#define MAX 1010using namespace std;int d[MAX];int g[MAX];int main(){ int t,n,x,i; scanf("%d",&t); while(t--) { scanf("%d",&n)
2012-12-12 23:43:26
524
原创 poj1163
#include#include#include#include#include#define MAX 101using namespace std;int triangle[MAX][MAX];int main(){ int n,i,j; while(~scanf("%d",&n)) { for(i=0;i<n;i++)
2012-12-12 23:31:59
414
原创 zoj3058
#include#include#include#include#include#define PI acos(-1)#define eps 1e-6using namespace std;struct circle{ double x,y,r; circle(){}; circle(double x,double y,double r):x(x),y(y
2012-12-12 00:37:47
289
原创 7
#include#include#include#include#include#includeusing namespace std;struct node{ int s,b; node(int s,int b):s(s),b(b) { } bool operator<(const node& rhs)const {
2012-12-10 23:57:45
301
原创 8
#include#include#include#include#include#include#define MAX 210using namespace std;char map[MAX][MAX];bool visit[MAX][MAX];int dir[2][4]={{0,0,1,-1},{1,-1,0,0}};int step[MAX][MAX];int m,n,
2012-12-10 23:19:42
251
原创 hdu2492
#include#include#include#include#include#define MAX 20010using namespace std;long long a[MAX];long long c[100005];long long d[MAX];long long f[MAX];long long t[MAX];long long h[MAX];long
2012-12-07 12:03:24
463
原创 poj2482
#include#include#include#include#include#define L(x) (x<<1)#define R(x) (x<<1|1)#define MAX 30010using namespace std;class line{public: long long x,y1,y2; int flag; line(){}
2012-12-06 15:05:35
587
原创 hdu4007
不知道为什么数组开到2000才能过#include#include#include#include#include#define L(x) (x<<1)#define R(x) (x<<1|1)#define MAX 2010using namespace std;int cy[MAX*2];class line{public: int x,y1,y2,flag
2012-12-05 23:08:54
352
原创 hdu4000
#include#include#include#include#include#define MAX 100010using namespace std;long long c[MAX];int seq[MAX];int lowbit(int x){ return x&(-x);}void add(int x,int n){ while(x<=n)
2012-12-04 11:16:09
430
原创 poj2104
#include#include#include#include#include#define L(x) (x<<1)#define R(x) (x<<1|1)#define MAX 100010using namespace std;int val[22][MAX];int sorted[MAX];int num[22][MAX];void build(int d,int
2012-12-02 21:41:11
493
原创 划分树
参考http://wenku.baidu.com/view/8fc6bc365a8102d276a22fa0.html划分树可以用来以O（lg（n））时间求出任意区间第k大元素觉得用到的思想和《算法导论》第九章p109的思想比较像，如果在一个序列里求第K大的元素，不一定需要对序列完全排序而是每次都进行快排的一步，从序列中选出一个x把比x小的都放在x前大的都放在x后边，然后看x前有几个元
2012-12-01 20:22:41
290
原创 hdu1823 二维线段树
#include#include#include#include#include#define MAX 101#define L(x) (x<<1)#define R(x) (x<<1|1)using namespace std;class subnode{ public: int l,r; double val; sub
2012-12-01 14:12:12
316
原创 zoj2859
第一种算法rmq参考http://blog.sina.com.cn/s/blog_88705ca20100ufl2.html#include#include#include#include#include#include#define MAX 301using namespace std;int dp[MAX][MAX][9][9];int matrix[MAX][M
2012-11-29 22:16:41
488
原创 hdu2795
#include#include#include#include#include#define L(x) (x<<1)#define R(x) (x<<1|1)#define MAX 200010using namespace std;struct node{ int l,r; int val;}a[MAX*3];int w;void build(int
2012-11-29 11:46:46
263
原创 poj3368
#include#include#include#include#define L(x) (x<<1)#define R(x) (x<<1|1)#define MAX 100010using namespace std;struct node{ int l,r; int vl,vr; int nl,nr; int maxlen;}a[MAX*3]
2012-11-29 00:08:32
247
原创 hdu3397
此题中维护操作略多，先说下思路有两种更新操作set和update分别为设置[a,b]为0或1和求[a,b]反；1.每次set操作时看是否是[a,b]覆盖区间，不是则查看是否此节点有set（1)或set（0)的标志，如果有的话，需要把这个set标志pushdown到L（t)，R（t)，然后再把[a,b]的取反标志f，pushdown下去，然后递归查找左右子树。如果【a,b]是覆盖区间
2012-11-27 23:08:28
488
原创 zoj3279
#include#include#include#include#define L(x) (x<<1)#define R(x) (x<<1|1)#define MAX 100010using namespace std;struct node{ int l,r; long long int sum;}a[MAX*3];long long int ant[MAX
2012-11-26 23:52:53
315
原创 poj3911
#include#include#include#include#define L(x) (x<<1)#define R(x) (x<<1 |1)#define MAX 100010using namespace std;struct node{ int l,r,wl,wr,bl,br,blen,wlen; bool f;}a[MAX*3];int stone
2012-11-26 15:26:46
388
原创 poj2892
#include#include#include#include#includeusing namespace std;int main(){ int n,m,i,l,r; char a[10]; stacks; setv; set::iterator it; while(scanf("%d%d",&n,&m)!=EOF) {
2012-11-26 11:41:35
365
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人