2016年09月_HOH_mizukun

原创 POJ_3169_Layout

#include#includeusing namespace std;#define MIN(a,b) ((a)<(b)?(a):(b))#define MAX_N 1000#define MAX_ML 10000#define MAX_MD 10000#define INF 100000000int N, ML, MD;int AL[MAX_ML], BL[MAX_ML]

2016-09-27 20:47:43 341

原创 POJ_3723_Conscription

//见《挑战程序设计竞赛》第2.5.6节#include#includeusing namespace std;#define MAX_N 20000#define MAX_E 50000int par[MAX_N];int ran[MAX_N];void init(int n) { for (int i = 0; i < n; i++) { par[i] = i;

2016-09-27 20:05:41 324

原创 POJ_3255_Roadblocks

//见《挑战程序设计竞赛》第2.5.6节#include#include#include#includeusing namespace std;#define INF 10000000#define MAX_N 5000#define MAX_R 100000typedef pair P;struct edge { int to, cost; };int N, R;v

2016-09-23 23:01:36 377

原创 POJ_1182_食物链

//见《挑战程序设计竞赛》第2.4.4节#includeusing namespace std;#define MAX_N 150001#define MAX_K 100000int par[MAX_N];int rank[MAX_N];void init(int n) { for (int i = 0; i < n; i++) { par[i] = i; rank

2016-09-20 21:16:28 274

原创 POJ_2431_Expedition

//见《挑战程序设计竞赛》第2.4.2节#include#include#includeusing namespace std;#define MAX_N 10000int L, P, N;struct stop{ int A; int B;}S[MAX_N + 1];bool cmp(stop s1, stop s2) { return s1.A > s2.A;

2016-09-20 18:53:26 229

原创 POJ_3253_Fence Repair

//见《挑战程序设计竞赛》第2.2.4节#include#include#define MAX_N 20000using namespace std;typedef long long ll;int N;int L[MAX_N];int main() { scanf("%d", &N); for (int i = 0; i < N; i++) scanf("%d",

2016-09-18 15:14:00 227

原创 POJ_3069_Saruman's Army

//见《挑战程序设计竞赛》第2.2.4节#include#include#define MAX_N 1000using namespace std;int N, R;int X[MAX_N];int main() { while (cin >> R >> N, R != -1 && N != -1) { for (int i = 0; i > X[i]; sort

2016-09-18 15:00:12 309

原创 POJ_3617_Best Cow Line

//见《挑战程序设计竞赛》第2.2.3节#include#define MAX_N 2000int main() { int N; char S[MAX_N]; scanf("%d", &N); for (int i = 0; i < N; i++) scanf("\n%c", S + i); int a = 0, b = N - 1, cnt = 0; while (a

2016-09-17 11:30:30 337

原创 POJ_2386_Lake Counting

#include#define MAX_N 100#define MAX_M 100int N, M;char field[MAX_N][MAX_M + 1];void dfs(int x, int y) { field[x][y] = '.'; for (int dx = -1; dx <= 1; dx++) { for (int dy = -1; dy <= 1; dy

2016-09-16 23:43:16 229

原创 POJ_1852_Ants

//两只蚂蚁相遇后转向，可以视为交错而过后沿原方向继续前进//即每只蚂蚁间的移动是互相独立的#include#define MAX(a,b) ((a)>(b)?(a):(b))int main() { int c, L, n, p; int minT, maxT, min, max; scanf("%d", &c); while (c--) { scanf("%d%d",

2016-09-16 19:13:48 258

原创 POJ_1068_Parencodings

//不解释，数学规律自己找(^-^)#includeint main(){ int t, n, i, j, p[21] = { 0 }; scanf("%d", &t); while (t--){ scanf("%d", &n); for (i = 1; i <= n; i++) scanf("%d", p + i); while (--i>0) *(p +

2016-09-16 18:31:11 294

原创 POJ_1045_Bode Plot

//无耻地抄了公式=_=!//公式推导：V2=iR=CR d/dt(Vs*cos(wt)-Vr*cos(wt+b))=Vrcos(wt+b)// CRw(sin(wt+b)-sin(wt))=Vr*cos(wt+b)// 令t=0化简得： tan(b)=1/(CRw)-------------(1)// 令wt+b=0化简得：Vr=

2016-09-16 18:24:23 338

原创 POJ_1010_STAMPS

//用MT[k][n][v] (k>=0, 0=0) 表示从前k个类型中，最多取n张，总面值为v的所有组合中最大的类型数。则有递推方程：//MT[k][n][v] = MAX{ MT[k-1][n-i][v-i*Values[k-1]] + (i>0?1:0) } (0=i*Values[k-1]) #include#include#includeusing namespace st

2016-09-03 23:32:16 370

HOH_mizukun的博客