摘要:        
/*比较苦逼的树形DP,慢慢来吧!不着急*/#include <iostream>#include <vector>using namespace std;const int SIZE = 105; int roomNumber, trooperNumber;int cost[SIZE], brai    阅读全文
posted @ 2017-01-10 23:51
王坤1993
阅读(376)
评论(0)
推荐(0)
        
            
        
        
摘要:        
#include <stdio.h>#include <string.h>#include <math.h> int n,m,t;char map[10][10];int flag;int di,dj,wall;int to[4][2] = {{0,-1},{0,1},{-1,0},{1,0}};     阅读全文
posted @ 2017-01-10 23:46
王坤1993
阅读(121)
评论(0)
推荐(0)
        
            
        
        
摘要:        
#include <stdio.h>#include <algorithm>using namespace std; struct Node{ double j,f,p;} node[10000]; int cmp(Node x,Node y){ return x.p>y.p;} int main(    阅读全文
posted @ 2017-01-10 23:39
王坤1993
阅读(263)
评论(0)
推荐(0)
        
            
        
        
摘要:        
/**最近点对的问题*/ #include #include #include using namespace std;const int SIZE = 100005;const int L = -1;const int R = 1; typedef struct{int index;double     阅读全文
posted @ 2017-01-10 13:11
王坤1993
阅读(130)
评论(0)
推荐(0)
        
            
        
        
摘要:        
//c++// #includeusing namespace std;int main(){int n,j,t,start;while (cin >> n,n){start =0;t = 0;while(n--){cin >> j;if (j>start){t += 6*(j-start);}el    阅读全文
posted @ 2017-01-10 13:11
王坤1993
阅读(120)
评论(0)
推荐(0)
        
            
        
        
摘要:        
#include<stdio.h>#includeusing namespace std;#define INF 0x7fffffffdouble D;struct node{double l;double r;}s[3][2];node interval(double a,double b)//解    阅读全文
posted @ 2017-01-10 13:10
王坤1993
阅读(142)
评论(0)
推荐(0)
        
            
        
        
摘要:        
//c//https://github.com/WEIZIBIN/acm/blob/master/hdu1004.c#include <stdio.h>#include <string.h>int main(){int i, n, j;char s[1005][15];int count[1005]    阅读全文
posted @ 2017-01-10 13:09
王坤1993
阅读(128)
评论(0)
推荐(0)
        
            
        
        
摘要:        
//c //https://github.com/WEIZIBIN/acm/blob/master/hdu1005.c#include <stdio.h>int main(){int i, result, a, b, j;long n;int f[50] = {0};f[1] = 1;f[2] =     阅读全文
posted @ 2017-01-10 13:09
王坤1993
阅读(124)
评论(0)
推荐(0)
        
            
        
        
摘要:        
//c++//https://github.com/zzdxfei/hduacm/blob/master/1003.cpp#include #include using namespace std; void ComputeMaxSubstr(const vector& sets,int& max_    阅读全文
posted @ 2017-01-10 13:08
王坤1993
阅读(144)
评论(0)
推荐(0)
        
            
        
        
摘要:        
//c#include"stdio.h"int main(){int i, j;while(scanf("%d%d", &i, &j) == 2)printf("%d\n", i + j);return 0;} //c++ #include using namespace std;int main(    阅读全文
posted @ 2017-01-10 13:07
王坤1993
阅读(184)
评论(0)
推荐(0)
        

浙公网安备 33010602011771号