- 博客(9)
- 收藏
- 关注
RSS订阅原创 hdu 1394
#include #include #define MAX_N 5001#define INF 99999999using namespace std;int a[MAX_N], n;struct node{ int left, right, val;}
2011-07-09 22:15:25
300
原创 usaco 3.2 Riding The Fences
/*ID:rayafjy1PROG:fenceLANG:C++*/#include #include #include #include #include #define MAX_N 501#define MAX_M 1024using namespac
2011-07-09 13:53:53
363
原创 uscao 3.2 Sweet Butter
/*ID:rayafjy1PROG:butterLANG:C++*/#include #include #include #include #define MAX_N 801#define INF 9999999using namespace std;i
2011-07-09 13:49:10
378
原创 usaco 3.2 Magic Squares
/*ID:rayafjy1PROG:msquareLANG:C++*/#include #include #include using namespace std;struct node{ short int a[8], c; int ste
2011-07-09 13:45:33
338
原创 usaco 3.1 Contact
/*ID:rayafjy1PROG:contactLANG:C++*/#include #include #include #include using namespace std;int ct[13][1 << 13];struct node {
2011-07-09 13:42:03
532
原创 hdu 3699
#include #include #include using namespace std;char s1[20], s2[20], s3[20];int l1, l2, l3;bool use[6];int ok(int a[]) { int i, x
2011-07-09 13:32:28
353
原创 hdu 1698
#include #include #define MAX_N 100001using namespace std;struct node{ int left, right, c;} tt[MAX_N * 4];void build(int left, i
2011-07-09 13:29:34
320
原创 hdu 1754
#include #include #define MAX_N 200005using namespace std;int a[MAX_N];struct node { int left, right, maxx;} tt[MAX_N * 3];int
2011-07-09 13:28:45
261
原创 hdu 1166
#include #include #include #define MAX_N 50001using namespace std;int a[MAX_N];char str[10];struct node { int left, right, sum;
2011-07-09 13:23:44
266
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人