动态规划
Wolfgang_baozi
查无此人
展开
-
UVA-116 Unidirectional TSP 多起点,多终点的最短路问题!(题意+思路+题解)
这里依旧是题目传送门UVA-116 Unidirectional TSPPreblem:Problems that require minimum paths through some domain appear in many different areas of computer science. For example, one of the constraints in VLSI ro...原创 2020-04-14 23:10:26 · 987 阅读 · 0 评论 -
POJ - 3624 Charm Bracelet | 手链 (经典0-1背包)题解
题目传送门:POJ - 3624 Charm Bracelet | 手链Bessie has gone to the mall’s jewelry store and spies a charm bracelet. Of course, she’d like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) a...原创 2020-02-09 13:36:42 · 387 阅读 · 0 评论 -
HDU 1159 Common Subsequence最长公共子序列(动态规划DP)
一道很经典的题目了先附上链接:题目传送门Problem Description:A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, …, xm> another seque...原创 2020-02-08 21:49:54 · 159 阅读 · 0 评论 -
题解POJ - 1651 Multiplication Puzzle (区间DP)
题目传送门The multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and scores the number of points equal to ...原创 2020-02-06 17:48:44 · 238 阅读 · 0 评论 -
Codeforces Round #612 (Div. 2) C. Garland题解
题目:Vadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of n light bulbs in a single row. Each bulb has a number from 1 to n (in arbitrary order), such t...原创 2020-02-05 18:31:56 · 400 阅读 · 0 评论