JACK_JYH的博客

#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){

#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;

#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",

#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-

#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

单调队列#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

#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

#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;

#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,

#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--) {

#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

#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--) {

#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()//完全背包{

#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]

#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

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

#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

#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

#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

#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

#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

#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

#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

#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