ZMST的博客

#include<cstdio>#include<cmath>#include<algorithm>#include<iostream>#include<cstring>using namespace std;#define maxn 10010int A[maxn],dp[maxn];int main(){ ...

题目链接：#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cstdlib>#include <map>#include <list>#include <vector&amp

断断续续动态规划学了五天了都要，今天一定要吧背包问题解决完去学STL1、01背包问题：有n件物品，每件物品的重量为W[i],价值为c[i].现有一个容量为V的背包，问如何选取物品放入背包，使得背包内物品的总价值最大其中每种物品都只有1件【分析】令dp[i][v]表示前i件物品恰好装入容量为v的背包中所能获得的最大价值考虑对第i件物品的选择策略，有两种策略：①不放第i...

题目链接：#include <iostream>#include<cstring>#include<cstdio>#include<algorithm>#include<cmath>using namespace std;#define maxn 1010string S;int dp[maxn][maxn];in...

令dp[i][j]表示S[i]至S[j]所表示的子串是否是回文子串，是则为1，不是为0这样根据S[i]是否等于S[j]，可以把转移情况分成两类：①若S[i]==S[j]，只要S[i+1]至S[j-1]是回文子串，S[i]至S[j]就是回文子串，如果S[i+1]至S[j-1]不是回文子串，则S[i]至S[j]也不是回文子串②若S[i]!=S[j],那么S[i]至S[j]一定不是回文子...

题目链接#include<bits/stdc++.h>using namespace std;#define N 111int origin[N],tempOri[N],changed[N];int n;bool isSame(int A[],int B[]){ for(int i=0;i<n;i++) { if(A[i]!=B[...

题目链接：#include <iostream>#include<cstring>#include<cstdio>#include<algorithm>using namespace std;const int maxc=210;const int maxn=10010;int HashTable[maxc];int A[max...

#include <iostream>#include<cstring>#include<cstdio>#include<algorithm>using namespace std;#define N 100int A[N],B[N];int dp[N][N];int main(){ int n; gets(A+1)...

#include <iostream>#include<cstring>#include<cstdio>using namespace std;#define N 100int A[N],dp[N];int main(){ int n; scanf("%d",&n); for(int i=1;i<=n;i++...

题目链接：#include<cstdio>#include<cmath>#include<algorithm>#include<iostream>#include<cstring>using namespace std;#define maxn 100010int dp[maxn],a[maxn];int s[max...