Search - Stone acm

Search - Stone acm - List

[Mathimatics-Numerical algorithms] STONE DL : 0: 算法分析ACM题目：石子合并算法保证能运行！算法分析课程必备！
Date : 2008-10-13 Size : 5.98kb User : 黄子聪
[Mathimatics-Numerical algorithms] 李学武提交C语言源代码 DL : 0: 李学武提交的C语言源代码，包括Hilbert曲线，高精度计算，π值计算公式，取石子游戏，趣味等式填数游戏3则，验证四色定理等- Li Xuewu submits the C language source code, including the Hilbert curve, the high accuracy computation, pi the value formula, takes the gravel game, the interest equality fills in the number to play 3 pieces, confirms four colors theorems and so on
Date : 2025-07-13 Size : 91kb User : 站长
[Mathimatics-Numerical algorithms] STONE DL : 0: 算法分析ACM题目：石子合并算法保证能运行！算法分析课程必备！-ACM Algorithm Analysis Title: stones combined algorithm guaranteed to run! Algorithm analysis courses required!
Date : 2025-07-13 Size : 145kb User : 黄子聪
[Internet-Network] ACM DL : 0: 在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分。例如，图1所示的4堆石，每堆石子数（从最上面的一堆数起，顺时针数）依次为4、5、9、4。则3次合并得分总和最小的方案为图2，得分总和最大的方案为图3。编程任务：对于给定n堆石子,编程计算合并成一堆的最小得分和最大得分。 -Playground in a circle around the stones are placed n heap. Stone is to have the order to merge into a pile. Provisions can only choose 2 adjacent stones piled into a heap of new and new pile of stones a few in mind for its combined score. Try to design an algorithm to calculate the n heap into a pile of stones the minimum scores and maximum scores. For example, shown in Figure 1 of 4 Rockfill, each pile a few stones (from the top of a pile of several cases, clockwise number) followed by 4,5,9,4. 3 times the combined score is the sum of the smallest program for the Figure 2, the sum of scores for the largest program of Figure 3. Programming tasks: for a given n stack stone, into a pile of programming the calculation of the minimum scores and maximum scores.
Date : 2025-07-13 Size : 4kb User : 张四四
[Algorithm] shitou DL : 0: 关于acm中的石头剪刀布的求解，用c++实现，在vc++中调试运行-Acm scissors on the cloth in the solution of stone, using c++ implementation, debugging in vc++ run
Date : 2025-07-13 Size : 2kb User : wangqiang
[Other] ACM DL : 0: 本文包含本人亲自写的两个ACM的小算法，一个是石子划分问题另一个是服务器转移问题，全是用的是动态规划算法，经试验，这两个算法运行效率极高-This article contains personally wrote two small ACM algorithm, a stone partition problem is transferred to another is a server problem, all using a dynamic programming algorithm, and tested, these two very efficient algorithm runs
Date : 2025-07-13 Size : 1kb User : 110