zytjyh-CSDN博客

原创 POJ 2231(贪心)

#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;const int INF = 0x3f3f3f3f;int position[

2016-08-20 17:49:31 261

原创 HDU 1078（贪心）

#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;const int INF = 0x3f3f3f3f;struct node{

2016-08-20 17:33:43 356

原创 POJ 1017（贪心）

#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;int main(){ int value[7]; int k

2016-08-20 16:21:27 299

原创 HDU 1050（贪心）

#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;int Count[200];bool cmp(int a, int b){

2016-08-20 15:39:32 310

原创 HDU 1052（贪心）

#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;int TianJi[1005];int WeiWang[1005];int

2016-08-20 14:56:46 301

原创 HDU 1009（贪心）

#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;struct node{ int Javabean; int

2016-08-20 11:28:52 299

原创 HDU 1049（贪心）

#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;int main(){ int height; int cli

2016-08-20 11:04:47 425

原创 HDU 1224（dp46）

#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;int spot[105];bool plane[105][105];int

2016-08-19 19:21:25 368

原创 HDU 1081（组大矩阵）

#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;const int INF = 0x3f3f3f3f;int a[105][1

2016-08-19 19:02:20 355

原创 HDU1158（dp46)

#pragma warning(disable:4996)#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;const int

2016-08-19 17:03:29 298

原创 HDU 1059（dp46,多重背包）

#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;int dp[500000]; int a[7];int HalfWeig

2016-08-19 15:53:15 285

原创 HDU 1503（字符串，合并输出）

#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;int dp[105][105];int mark[105];int pat

2016-08-19 14:51:32 257

原创 HDU 1503（字符串，合并输出）

#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;int dp[105][105];int mark[105];int pat

2016-08-19 14:51:18 545

原创 HDU 1227（区间dp）

#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;int dp[35][205];int pos[205];int f[205

2016-08-19 11:20:11 281

原创 HDU 2844（多重背包）

如果没有多重背包没有那个if，也就是不考虑完全背包，全部当成01背包时间，时间会翻倍。#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace s

2016-08-18 20:12:55 312

原创 HDU 1176（数塔）

#pragma warning(disable:4996)#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;int dp[100

2016-08-18 15:48:06 234

原创 HDU 1069（最长递减子序列&&长方体处理技巧）

#pragma warning(disable:4996)#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;int dp[95]

2016-08-18 14:55:00 276

原创 POJ 2549（中间相遇）

#pragma warning(disable:4996)#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;const int

2016-08-17 22:20:14 332

原创 POJ 3744（矩阵概率dp）

#pragma warning(disable:4996)#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<time.h>using namespace std;struct Mat

2016-08-17 15:52:44 361

原创 HDU 4405（概率dp）

#pragma warning(disable:4996)#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>using namespace std;const int INF = 0x3f3f3f3f;

2016-08-17 15:25:09 281

原创 POJ 2096 (概率dp）

#pragma warning(disable:4996)#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>using namespace std;const int INF = 0x3f3f3f3f;

2016-08-17 14:42:55 298

原创 POJ 3342（树形dp）

wa#pragma warning(disable:4996)#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<vector>#include<algorithm>#include<iostream>using namespace std;const int INF = 0x3f3f3f3

2016-08-17 10:11:25 371

原创 POJ 3345（树形dp）

wa#pragma warning(disable:4996)#include<cstdio>#include<cstring>#include<cmath>#include<vector>#include<algorithm>#include<iostream>#include<map>using namespace std;const int INF=0x3f3f3f3f;in

2016-08-16 10:37:53 420

原创 HDU 1011（树形dp）

wa#pragma warning(disable:4996)#include<cstdio>#include<cstring>#include<cmath>#include<vector>#include<algorithm>#include<iostream>using namespace std;int dp[105][105];int cost[105];int value

2016-08-15 22:46:22 337

原创 HDU 1520（树形dp）

#pragma warning(disable:4996)#include<cstdio>#include<cstring>#include<cmath>#include<vector>#include<algorithm>#include<iostream>using namespace std;int father[6005];int dp[6005][2];int value

2016-08-15 22:04:47 305

原创 HDU 1561（树形dp）

#include<cstdio>#include<cstring>#include<cmath>#include<vector>#include<algorithm>#include<iostream>using namespace std;int dp[210][210];vector<int> list[210];int N, M;void dfs(int father){

2016-08-15 16:17:31 425

原创 HDU 3008（dp46）

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int magic[105];int attack[105];int dp[105][105];int main(){ int n,t,q; while(scanf("%d%d%d",&n

2016-08-14 22:28:03 361

原创 HDU 1501（dp46）

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;bool dp[205][205];char str1[205],str2[205],str3[410];int main(){ int T; scanf("%d",&T); str

2016-08-14 22:27:19 329

原创 HDU 1300（dp46）

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int number[105],price[105];int dp[105];int main(){ int T; scanf("%d",&T); while(T--) {

2016-08-14 22:26:38 314

原创 HDU 1422（dp46）

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int dp[200005];int main(){ int n; while(scanf("%d",&n)!=EOF) { int i; int a,

2016-08-14 22:25:52 298

原创 HDU 1074（dp46）（状态压缩dp）

#include<iostream> #include<cstdio>#include<cstring>#include<algorithm> #include<stack>using namespace std;const int INF=0x3f3f3f3f;struct node1{ string name; int deadline; int cost;

2016-08-14 22:25:11 326

原创 HDU 1080（dp46)

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int dp[1005][1005];char str1[1005],str2[1005];int map[5][5]={{5,-1,-2,-1,-3}, {-1,5,-3,-2

2016-08-14 22:23:59 286

原创 HDU 2191（dp46）

单调队列#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int n,m;int i,j,k;int p[105],h[105],c[105];int dp[2500];void MPqueue(int dp[], int SumValue, int v

2016-08-14 22:23:12 272

原创 HDU 2870 （dp46）

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;char map[1005][1005];int dp[1005][1005];int l[1005];int r[1005];int Max;int n,m;void DP(){ int

2016-08-14 22:21:28 367

原创 HDU 2577（dp46）

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int dp[105][2];char str[105];int main(){ int num; int i; scanf("%d\n",&num); while(num-

2016-08-14 22:20:29 303

原创 HDU 2159（dp46）

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int a[105], b[105];int dp[105][105];int main(){ int N, M, K, S, i, j, k; while(scanf("%d%d%d%d",

2016-08-14 22:19:45 239

原创 HDU 1203（dp46）

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;double dp[10005];struct node{ int money; double pro;}school[10005];int main(){ int n,m;

2016-08-14 22:18:24 232

原创 HDU 2048 （dp46）

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int dp[105][105];int a[105][105];int main(){ int C; scanf("%d",&C); while(C--) {

2016-08-14 22:17:24 338

原创 HDU 1171（dp46）

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int dp[500000];int value[1005];int number[1005];int MidSum;int Sum;int i;void Complete()//完全背包{

2016-08-14 22:16:18 279

原创 C++Primer第三章（第五版）课后习题程序题源代码

3.1#include<iostream>using std::cout;using std::endl;int main(){ int sum = 0; int i = 50; while (i <= 100) { sum += i; i++; } cout << "50到100之间整数之和为" << sum <

2016-08-14 22:13:54 559

空空如也

空空如也