动态规划
文章平均质量分 76
爱玲姐姐
大家好,我是计爱玲,英文名:Cathy,是一名前端开发工程师,热爱解锁各种前端新技术。我的爱豆是王一博,当然我也想认识更多同行的帅哥,
我的微信jal517486222,欢迎加我好友交流编程技术*^_^*
个人网站:https://jiailing.com
展开
-
PAT-Top-1002 Business (35分) 动态规划(0-1背包)
1002 Business (35分)题目传送门:1002 Business (35分)一、题目大意任务调度··二、解题思路刚开始用dfs超时了···然后参考了某位网友的思路,使用动态规划写出来了参考题解:https://blog.csdn.net/qq_41562704/article/details/100826468三、AC代码#include<bits/stdc++....原创 2020-02-15 16:31:41 · 780 阅读 · 0 评论 -
PAT-A-1068 Find More Coins (30 分)动态规划(背包)C++题解
1068 Find More Coins (30 分)题目传送门:1068 Find More Coins (30 分)一、题目大意给定n个硬币,求组成m的硬币的最小字典序组合二、解题思路背包问题。刚开始没想到什么好的思路,参考了这篇博客:1068 Find More Coins (30 分)背包问题三、AC代码#include<bits/stdc++.h>using ...原创 2019-08-27 06:37:39 · 906 阅读 · 0 评论 -
PAT-A-1045 Favorite Color Stripe (30 分) 动态规划--最长非降子序列 C++题解
1045 Favorite Color Stripe (30 分)题目传送门:1045 Favorite Color Stripe (30 分)一、题目大意给定数组1、数组2,求数组2的最长的符合数组1中元素顺序的子序列。For example, given a stripe of colors {2 2 4 1 5 5 6 3 1 1 5 6}. If Eva’s favorite c...原创 2019-08-21 23:31:27 · 917 阅读 · 0 评论 -
PAT-A-1049 Counting Ones (30 分) 数位DP C++题解
1049 Counting Ones (30 分)题目传送门:1049 Counting Ones (30 分)一看到这道题就知道考的是数位DP,倔强的我不想找模板~~,自己写才有成就感。昨晚临睡觉前开始写的,今天早起继续写,居然一交就AC了,呵呵,开心原创 2019-08-23 07:28:26 · 924 阅读 · 0 评论 -
PAT-A-1040 Longest Symmetric String (25 分) 动态规划求最长对称字串 C++题解
1040 Longest Symmetric String (25 分)题目传送门:1040 Longest Symmetric String (25 分)一、题目大意求字符串的最大对称子串的长度二、解题思路这道题可以用动态规划来处理,转移方程为:dp[i]=dp[i−1]+2,当s[i]==s[i−1]dp[i] = dp[i-1] + 2, 当s[i] == s[i-1]dp[...原创 2019-08-20 14:50:33 · 817 阅读 · 0 评论 -
AOJ2903. USACO 3.1.2 Score Inflation (完全背包)
USACO 3.1.2 Score Inflation (完全背包)一、题目大意题目传送门:USACO 3.1.2 Score Inflation 二、解题思路这是个典型的完全背包,就是不限定物品数量,求最大价值。刚开始用贪心写的,居然过了11/12的数据,可怕,最后一组过不了,换成了dp才过了全部数据。我以为根据比重排序就行了,但想想感觉好像有点问题,幸好最后一组数据让我WA掉了,要不...原创 2019-07-24 15:48:56 · 734 阅读 · 0 评论 -
最优找零问题。贪心/动态规划
一、假设货币面额有1,2,5,10,20,50,100,每种数量都无限多,现在给出金额n(1<=n<=100000),求出最少的货币数量。这种题可以用贪心来做,因为前n-1项的和都不超过第n项的值,所以符合贪心的规则。#include<bits/stdc++.h>using namespace std;int main(){ vector<int>...原创 2018-11-06 14:53:36 · 5803 阅读 · 2 评论 -
动态规划求最长上升子序列两种算法
动态规划求最长上升子序列两种算法一、O(N2){O(N^2)}O(N2)算法#include<bits/stdc++.h>using namespace std;int main(){ int n; while(cin >> n){ int v[n+1]; for(int i = 1; i <= n; i++){ cin >> v[i...原创 2018-11-06 14:37:49 · 1980 阅读 · 0 评论 -
nyist203 三国志 (最短路径-01背包)
三国志 (nyist 203) 解题思路请看代码块中的注释~JAVA版AC代码:package nyist.part8graph;import java.util.Arrays;import java.util.Scanner;/** * 考查算法:最短路,01背包 * 由于每个武将到达一个城池后,如果拿下宝藏,就得留下来镇守,即不能离开, * 所以可以使用Di...原创 2018-05-24 19:50:32 · 798 阅读 · 0 评论 -
POJ 2411 Mondriaan's Dream (轮廓线DP代码详解)
Mondriaan’s Dream(POJ 2411)Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 18772 Accepted: 10717 DescriptionSquares and rectangles fascinated the famous Dutch painter Piet...原创 2018-02-24 22:07:31 · 946 阅读 · 0 评论 -
ZOJ 4257 Most Powerful (状态压缩)
Most Powerful(ZOJ 4257)Time Limit: 2 Seconds Memory Limit: 65536 KB Recently, researchers on Mars have discovered N powerful atoms. All of them are different. These atoms have some properties....原创 2018-02-24 17:46:22 · 741 阅读 · 0 评论 -
HDU 3001 Travelling (状态压缩/三进制)
Travelling(HDU 3001)Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8931 Accepted Submission(s): 2914Problem Description After coding ...原创 2018-02-24 16:40:35 · 787 阅读 · 0 评论 -
POJ 3311 Hie with the Pie (弗洛伊德/TSP/状态压缩)
Hie with the Pie (POJ3311)Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 8639 Accepted: 4722 DescriptionThe Pizazz Pizzeria prides itself in delivering pizzas to its custome...原创 2018-02-23 23:24:25 · 1240 阅读 · 0 评论 -
POJ 1185 炮兵阵地 (经典状态压缩题)
炮兵阵地(POJ 1185)Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 30481 Accepted: 11762 Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用”H” 表示),也可能是平原(用”P...原创 2018-02-23 16:34:19 · 1113 阅读 · 0 评论 -
POJ 3254 Corn Fields(状态压缩)代码详解
Corn Fields(POJ 3254)Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 18002 Accepted: 9478 DescriptionFarmer John has purchased a lush new rectangular pasture composed of M...原创 2018-02-23 13:52:03 · 742 阅读 · 0 评论 -
POJ 2288 Islands and Bridges (TSP 状态压缩DP)
Islands and Bridges(POJ 2288)Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 11563 Accepted: 3034 DescriptionGiven a map of islands and bridges that connect these islands,...原创 2018-02-21 16:30:00 · 948 阅读 · 0 评论 -
POJ 1141 Brackets Sequence(动态规划 / 递归)
Brackets Sequence (POJ 1141)Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 33360 Accepted: 9662 Special Judge DescriptionLet us define a regular brackets sequence in...原创 2018-02-21 12:35:57 · 785 阅读 · 0 评论