背包
SY_Pistachio
低调的前行,越努力越幸运!
展开
-
动态规划 多重背包 Coins
People in Silverland use coins.They have coins of value A1,A2,A3...An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice watch in...原创 2018-04-07 17:31:18 · 348 阅读 · 1 评论 -
ACM 动态规划 完全背包 E - Monkey and Banana
A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with some blocks. If the m...原创 2018-04-08 21:52:21 · 190 阅读 · 0 评论 -
动态规划 背包问题描述 状态转化方程
1. 0-1背包:总来源(https://blog.csdn.net/slience_646898/article/details/78638125) (1)状态转化方程: f[i,j] = Max{ f[i-1,j-Wi]+Pi( j >= Wi ), f[i-1,j] } 2.多重背包:总来源(https://blog.csdn.net/acdreamers/a...原创 2018-04-08 22:04:12 · 298 阅读 · 0 评论 -
CF(0-1背包)
CFTime Limit: 1000 ms Memory Limit: 65536 KiB Submit Statistic Discuss Problem DescriptionLYD loves codeforces since there are many Russian contests. In an contest lasting fo...原创 2018-04-14 15:56:14 · 252 阅读 · 0 评论 -
Charm Bracelet(poj 3464 0-1背包 动态规划)
Charm Bracelet Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 47080 Accepted: 20026 Description Bessie has gone to the mall's jewelry store and spies a charm bracelet...原创 2018-08-12 11:50:47 · 246 阅读 · 0 评论 -
ACM-ICPC 2018 焦作赛区网络预赛
A Magic Mirror 最开始提交的时候,忘记判断strlen(s)>6的情况,考虑不周到,以后一定考虑全面再提交。 #include<bits/stdc++.h> using namespace std; int main(){ int t; scanf("%d",&t); while(t--){ char s[20]...原创 2018-09-23 11:48:55 · 229 阅读 · 0 评论