ACM之路

以下面的这道题为例。。有一个箱子容量为V（正整数，0＜＝V＜＝20000），同时有n个物品（0＜n＜＝30），每个物品有一个体积（正整数）。要求n个物品中，任取若干个装入箱内，使箱子的剩余空间为最小。输入描述 Input Description一个整数v，表示箱子容量一个整数n，表示有n个物品接下来n个整数，分别表示这n 个物

突然发现我上上次的博文，，，讲的就是完全背包啊。。。DP[]

#include #include #include #include using namespace std;int T,m;bool smallest[32];bool biggest[32];int s[32][32];bool map[32][32];int f[32];int begain;int deg[32];int result[32];int deg_

#include #include int a[12][102];int f[12][102];int path[12][102];int record;int m,n;int cor;int min(int x,int y){ return x>y?y:x;}void print(int i,int j){ if(j>0) { print(path[i][j],

动态规划中的并行优化

MaginaTime Limit: 60000/30000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 545    Accepted Submission(s): 178Problem DescriptionMagina, also known as A

PebblesTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1222    Accepted Submission(s): 706Problem DescriptionYou're given an unlimit

Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8670 Accepted: 4622DescriptionFarmer John has purchased a lush new rectangular pasture compos

Hie with the PieTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5031 Accepted: 2678DescriptionThe Pizazz Pizzeria prides itself in delivering pizzas to

炮兵阵地Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 20433 Accepted: 7917Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表示），也可能是平

Washing ClothesTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 8867 Accepted: 2809DescriptionDearboy was so busy recently that now he has piles of clot

DescriptionBessie 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 theN (1 ≤ N ≤ 3,402) available charms.

【科普】什么是BestCoder？如何参加？饭卡Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13530    Accepted Submission(s): 4696Problem Descr

AreYouBusyTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3242    Accepted Submission(s): 1248Problem DescriptionHappy New Term!As

这道题要按照ai排序。最优解可能在delta ai,ai-1 中放了块东西。如果先放ai大的可能使得ai小的并且存在在最优解中的那块没放进去。比如  1*4 5*6  如果先放5的话，此时5 》 4 。所以不能放1了。 ans = 5但是实际上如果先放1的话，此时1 《 6,依然可以放下5,此时可以放下5. ans = 6所以看起来不能用动态规划来做。。。但是实际上最优

Cow ExhibitionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9612 Accepted: 3715Description"Fat and docile, big and dumb, they look so stupid, they aren'

Bone Collector IITime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2667    Accepted Submission(s): 1394Problem DescriptionThe title of

Proud MerchantsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 3018    Accepted Submission(s): 1247Problem DescriptionRecently, iSe

Charm BraceletTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26525 Accepted: 11925DescriptionBessie has gone to the mall's jewelry store and spies a ch

括号匹配（二）时间限制：1000 ms  |  内存限制：65535 KB难度：6描述给你一个字符串，里面只包含"(",")","[","]"四种符号，请问你需要至少添加多少个括号才能使这些括号匹配起来。如：[]是匹配的([])[]是匹配的((]是不匹配的([)]是不匹配的输入第一行输入一个正整数N，表示测试数据组数(N每组测试数

D - MixturesTime Limit:3000MS     Memory Limit:1572864KB     64bit IO Format:%lld & %lluSubmit Status Practice SPOJ MIXTURESDescriptionHarry Potter has n mixtures in front of h

总结 变量名addToss is an important part of any event. When everything becomes equal toss is the ultimate decider.Normally a fair coin is used for Toss. A coin has two sides head(H) and tail(T). Superst

Attack on TitansTime Limit: 2 Seconds      Memory Limit: 65536 KBOver centuries ago, mankind faced a new enemy, the Titans. The difference of power between mankind and their newfound enemy w

Palindrome subsequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65535 K (Java/Others)Total Submission(s): 2641    Accepted Submission(s): 1065Problem DescriptionIn

String painterTime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2368    Accepted Submission(s): 1038Problem DescriptionThere are t

H. Queries for Number of Palindromestime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou've got a string s 

Cheapest PalindromeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6919 Accepted: 3354DescriptionKeeping track of all the cows can be a tricky task so F

1. 变量 1.1 引用存在栈中，对象存在堆中1.2 类的成员函数在堆中，然后初始化为0。2.基本类型 2.1 存在栈中           直接存储值

The King’s Ups and DownsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 366    Accepted Submission(s): 245Problem DescriptionThe

Number StringTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1560    Accepted Submission(s): 699Problem DescriptionThe signatur

Multi-bit TrieTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 543    Accepted Submission(s): 217Problem Description　　IP lookup i

D. Coloring Bracketstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOnce Petya read a problem about a brac

#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; int n,tot;const int N = 10;const int M = 1000;int d

ComputerTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4386    Accepted Submission(s): 2207Problem DescriptionA school bought t

Anniversary partyTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6633    Accepted Submission(s): 2953Problem DescriptionThere is

RobberiesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16086    Accepted Submission(s): 5890Problem DescriptionThe aspiring Ro

不要62Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25749    Accepted Submission(s): 8954Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62（音：

BombTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 10630    Accepted Submission(s): 3753Problem DescriptionThe counter-terrori

RelocationTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2651 Accepted: 1080DescriptionEmma and Eric are moving to their new house they bought after