ych_ding的专栏

#include#includeusing namespace std;struct clrg{ char color[16]; int sum; int i; int a[100];};static int dp[100001];//#define DEBUGint main(){#ifdef DEBUG fstream cin("G:\\book\\al

#include#include#includeusing namespace std;//#define DEBUG/* 244K 0MS */static const int MAX = 101;static int count[MAX];static int price[MAX];static int presum[MAX];static int n;static

问题描述：https://oj.leetcode.com/problems/word-break/点击打开链接Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more diction

问题描述：https://oj.leetcode.com/problems/edit-distance/点击打开链接Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 st

问题描述：https://oj.leetcode.com/problems/palindrome-partitioning-ii/点击打开链接Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed

#include#includeusing namespace std;static int n;static const int N = 5001;static char str[N];static char rstr[N];static int c[N][N];//#define DEBUGint lcs(){ int i, j; for (i = 0; i <

#include#includeusing namespace std;//#define DEBUGstatic const int MAX = 1001;static int seq[MAX];static int f[MAX];int main(){#ifdef DEBUG fstream cin("G:\\book\\algorithms\\acm\\Debug

问题描述：有n种面值货币，给定一个钱的数目x，要求最少的货币数目表示。问题分析：该问题看似像贪心，先选用面值大的货币，再选用面值小的货币。实际并不具备贪心选择的性质。使用贪心不能确保得到最优解。定义：f(x)   表示x所需要的最小货币数目a[n]  n种面值推导：f(x) = min { f(x - a[i]) }  任意i 使得 x - a[i] >=0

#include#includeusing namespace std;static const int N = 3403;static const int M = 12881;static int f[N][M];static int c[N], v[N];//#define DEBUGint main(){#ifdef DEBUG fstream cin("G:\