- 博客(9)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 Ural 1437
I HATE THIS PROBLEM!!! I just write a BF solution like this:#include#include#include#include#include#include#includeusing namespace std;#define sf scanf#define pf printf#define re
2013-11-27 13:42:15
640
原创 Ural 1371. Cargo Agency
The author is lazy..Code :#include#include#include#include#include#includeusing namespace std;#define sf scanf#define pf printf#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)#def
2013-11-27 11:49:13
715
原创 Ural 1362 Classmates 2
Link To The Pro其实就是简单的树形dp；假设v1,v2,v3..vs是u的儿子，那么将dp[vi]从大到小排序；dp[u] = max(dp[v_i] + i];Code:#include#include#include#include#include#includeusing namespace std;#define
2013-11-27 09:58:00
956
原创 HDU 1027 Ignatius and the Princess II
全排列，next_permutation#include #include #include #include #include #include using namespace std;#define sf scanf#define pf printf#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)#define
2013-11-10 16:03:55
623
原创 HDU 1025 Constructing Roads In JGShining's Kingdom
LIS#include #include #include #include #include using namespace std;#define sf scanf#define pf printf#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)#define dbg(x) cerr << "Line:" << __LI
2013-11-10 15:55:15
518
原创 HDU 1023 Train Problem II
大数 卡特兰数#include #include #include #include #include using namespace std;#define sf scanf#define pf printf#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)#define dbg(x) cerr << "Line:"
2013-11-10 15:01:20
667
原创 HDU 1022 Train Problem I
栈模拟#include #include #include #include #include using namespace std;#define sf scanf#define pf printf#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)#define dbg(x) cerr << "Line:" << __LI
2013-11-10 14:24:07
643
原创 HDU 1011 Starship Troopers
树形dp#include #include #include #include #include using namespace std;#define sf scanf#define pf printf#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)#define dbg(x) cerr << "Line:" << __L
2013-11-10 13:53:54
760
原创 HDU 1007 Quoit Design
最近点对 。#include #include #include #include #include using namespace std;#define sf scanf#define pf printf#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)#define dbg(x) cerr << "__LINE__
2013-11-10 12:56:53
809
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人