Location:
Search - cave.c
Search list
Description: C++源代码，递归实现。原问题描述：鼓上蚤时迁到一个山洞里去盗宝，里面有n件宝贝，价值分别是a1,a2......an，并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包，能装的东西最大价值是K，他只能进洞一次，请问他最多能带出多少？
要求：输入K，n，a1，a2......an
输出：他能最多带出的宝物价值
-C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures
Platform: |
Size: 1024 |
Author: shubin |
Hits:
Description: CDMA 认证算法 CAVE算法 C 语言源码-CDMA authentication algorithm CAVE algorithm C language source
Platform: |
Size: 2048 |
Author: summy |
Hits:
Description: C # wpf case 不错的学习代码,很好-C# WPF case C# WPF case good learning code, very good
Platform: |
Size: 18432 |
Author: zPyqic |
Hits: