动态规划
文章平均质量分 74
wxz1120171495
这个作者很懒,什么都没留下…
展开
-
UVA Lighting System Design
#include <cstdio>#include <cstring>#include <iostream>#include <cmath>#include <algorithm>using namespace std;int s[1005];//表示前i中灯泡总的数量int d[1005];//表示最小的开销struct...原创 2018-03-17 23:23:13 · 121 阅读 · 0 评论 -
UVA Partitioning by Palindromes
#include <cstdio>#include <iostream>#include <algorithm>#include <cstring>using namespace std;char s[1005];int dp[1005];//表示以i结尾的字符串最少分割的回文字符串bool judge(int i, int j)//判...原创 2018-03-19 00:06:36 · 96 阅读 · 0 评论 -
UVA A Spy in the Metro
#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <cmath>using namespace std;const int inf = 0x3f3f3f3f;bool train[210][51][3];//t...原创 2018-03-12 23:21:29 · 109 阅读 · 0 评论 -
UVA Cutting Sticks
#include <cstdio>#include <iostream>#include <cstring>#include <algorithm>#include <cmath>using namespace std;int n,l;const int maxn = 0x3f3f3f3f;int dp[55][55];...原创 2018-03-29 18:48:06 · 129 阅读 · 0 评论 -
POJ Multiplication Puzzle
#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>using namespace std;int dp[105][105];int a[105];int main(){ int n; cin >> n; for (int...原创 2018-03-25 21:45:35 · 202 阅读 · 0 评论 -
UVA
#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;int n;struct node{ int x, y;}p[55];//double dp[100][100];//dp定义i到j最佳方案,最...原创 2018-03-26 00:26:51 · 133 阅读 · 0 评论