龙崎的专栏

Language:DefaultSpace ElevatorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7307 Accepted: 3429DescriptionThe cows are going to space! They pl

acdream群赛

A. Dima and Guards只需要比较一下，守卫的最小要求的和与给定值的大小即可#include#includeusing namespace std;int n,x1,y1,x2,y2;int who,choc,juice;bool can(int x,int y){ return x+y<=n;}int main(){ cin>>n;

Coin Change Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make changes with these coins for a given amount of money.For example, if we h

Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu

典型的01背包。题意：告诉你所有牛的高度和棚的高度，问最小差多少。刚开始看错题了，wa了好多遍，我以为是牛的高度不能超过b，可原题是说超过的最小高度，悲催了。#include#include#includeusing namespace std;long long high[25];long long f[1000050];int main(){ int n;

2447: 吃饭Time Limit: 1 Sec  Memory Limit:64 MBSubmit: 10  Solved: 4[Submit][Status][Web Board]Description桐桐放学了，在学校食堂吃起了饭…．这里的饭十分好吃，但是桐桐的钱有限且肚子空间有限（^_^），虽然每种饭有无限多，但他只能吃部分，且每一种饭可增加一定的能量。桐

Language:DefaultTug of WarTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 8023 Accepted: 2153DescriptionA tug of war is to be arranged at the lo

刚开始看了半天题目，没太看明白，但看看样例你就知道什么意思了。自己没想到用01背包怎么做，于是看了人家的代码，是把连续的k节车厢的人加起来，然后多加起来的数组背包，由于刚开始做dp，感觉自己形不成dp的思路，很混乱。想把它改成一位数组的，但不太会改，还需努力努力啊！#include#include#include#includeusing namespace std;int tr

前几天遇到过多重背包，不太会，没做，今天又遇到了，有必要学一下一种好想好写的基本方法是转化为01背包求解：把第i种物品换成n[i]件01背包中的物品，则得到了物品数为Σn[i]的01背包问题，直接求解，复杂度仍然是O(V*Σn[i])。但是我们期望将它转化为01背包问题之后能够像完全背包一样降低复杂度。仍然考虑二进制的思想，我们考虑把第i种物品换成若干件物品，使得原问题中第i种物品可取

Language:DefaultCoinsTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 25858 Accepted: 8750DescriptionPeople in Silverland use coins.They have coi

Language:DefaultThe Fewest CoinsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4208 Accepted: 1251DescriptionFarmer John has gone to town to buy so

Language:DefaultTriangular PasturesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5789 Accepted: 1855DescriptionLike everyone, cows enjoy varie

Language:DefaultDividingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 53204 Accepted: 13555DescriptionMarsha and Bill own a collection of marb

db={}def newuser(): prompt='Login desired: ' while True: name=input(prompt) if name in db: prompt='name taken,try again' else: break; pwd=in