Location:
Search - 1180
Search list
Description: 根据IEEE 1180-1990写的测试iDCT精确性。
Platform: |
Size: 11018 |
Author: |
Hits:
Description: 介绍了ＩＥＥＥ１１８０-１９９０标准离散余弦变换精度测试的指标及计算公式，对采用ＤＣＴ的编解码器如mpeg2的一致性测试有比较大的帮助
Platform: |
Size: 19132 |
Author: 江巧微 |
Hits:
Description: IEEE Std 1180-1990. IEEE Standard Specifications for the Implementations of 8x8 Inverse Discrete Cosine Transform, specifies the numerical characteristics of the 8x8 inverse discrete cosine transform (IDCT) for use in visual telephony and similar applications where the 8x8 IDCT results are used in a reconstruction loop. The specifications ensure the compatibility between different implementations of the IDCT.
Platform: |
Size: 630316 |
Author: linjianguang |
Hits:
Description: 根据IEEE 1180-1990写的测试iDCT精确性。- Test iDCT accuracy 1180-1990 writes which according to IEEE.
Platform: |
Size: 11264 |
Author: |
Hits:
Description: 介绍了ＩＥＥＥ１１８０-１９９０标准离散余弦变换精度测试的指标及计算公式，对采用ＤＣＴ的编解码器如mpeg2的一致性测试有比较大的帮助-Introduction of IEEE1180-1990 standard discrete cosine transform accuracy test indicators and calculation formula for the use of DCT codecs such as mpeg2 consistency test has more help
Platform: |
Size: 19456 |
Author: 江巧微 |
Hits:
Description: IEEE Std 1180-1990. IEEE Standard Specifications for the Implementations of 8x8 Inverse Discrete Cosine Transform, specifies the numerical characteristics of the 8x8 inverse discrete cosine transform (IDCT) for use in visual telephony and similar applications where the 8x8 IDCT results are used in a reconstruction loop. The specifications ensure the compatibility between different implementations of the IDCT.
Platform: |
Size: 629760 |
Author: linjianguang |
Hits:
Description: Problem F:石子合并
Time Limit:1000MS Memory Limit:65536K
Total Submit:1180 Accepted:386
Language: not limited
Description
在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分。
例如，图1所示的4堆石，每堆石子数（从最上面的一堆数起，顺时针数）依次为4、5、9、4。则3次合并得分总和最小的方案为图2，得分总和最大的方案为图3。
编程任务：
对于给定n堆石子,编程计算合并成一堆的最小得分和最大得分。
Input
输入第1 行是正整数n，1<=n<=100，表示有n堆石子。
第二行有n个数，分别表示每堆石子的个数。
Output
程序运行结束时，输出两行，第1 行中的数是最小得分；第2 行中的数是最大得分。
Sample Input
4
4 4 5 9
Sample Output
43
54
-tone combine
Platform: |
Size: 1024 |
Author: yhw |
Hits:
Description: article about class E of ISO 14443A
Platform: |
Size: 133120 |
Author: kawachino |
Hits:
Description:
1037 A decorative fence
1042 Gone Fishing
1062 昂贵的聘礼
1074 Parallel Expectations
1093 Formatting Text
1112 Team Them Up!
1143 Number Game
1160 Post Office
1178 Camelot
1179 Polygon
1180 Batch Scheduling
1187 陨石的秘密
1189 钉子和小球
1191 棋盘分割
1192 最优连通子集
1208 The Blocks Problem
1239 Increasing Sequences
1240 Pre-Post-erous!
1293 Duty Free Shop
-1037 A decorative fence
1042 Gone Fishing
1062 昂贵的聘礼
1074 Parallel Expectations
1093 Formatting Text
1112 Team Them Up!
1143 Number Game
1160 Post Office
1178 Camelot
1179 Polygon
1180 Batch Scheduling
1187 陨石的秘密
1189 钉子和小球
1191 棋盘分割
1192 最优连通子集
1208 The Blocks Problem
1239 Increasing Sequences
1240 Pre-Post-erous!
1293 Duty Free Shop
Platform: |
Size: 240640 |
Author: Liuk |
Hits:
Description: 【麻省理工大学】算法导论
Introduction to Algorithms, Second Edition
by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein ISBN:0262032937
The MIT Press © 2001 (1180 pages)
A course in computer algorithms, suitable for use as a field reference for working software developers.
-Massachusetts Institute of Technology】 【Introduction to Algorithms
Introduction to Algorithms, Second Edition
by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein ISBN:0262032937
The MIT Press © 2001 (1180 pages)
A course in computer algorithms, suitable for use as a field reference for working software developers.
Platform: |
Size: 18713600 |
Author: 天堂路 |
Hits:
Description: IEEE 1180号标准中关于MPEG标准下，对IDCT算法进行精度测试的小程序-IEEE 1180 standard number on the MPEG standards, the IDCT algorithm is tested for accuracy on a small program
Platform: |
Size: 459776 |
Author: 刘文 |
Hits:
Description: 函数功能：
--- --- --- --- --- --- --- --- --- --- ----
用4个按键控制四个数码管的显示
四个按键分别k1，k2，k3，k4。
实现功能：
1. K1 单击，数码管上显示的数加1，加到9999后，再单击，显示0000
2. K2 单击 数码管上显示的数减1，减到0000后，再单击，显示9999
3. K1双击 数码管上显示的数加5，加到超过9999后，再双击，显示超出的数，如当前显示为9998，双击后，显示4
4. K2双击 数码管上显示的数减5，加到超过0后，再双击，显示超出的数与9999的和，如当前显示为1，双击后，显示9995
5. K1连击 数码管上的以步长为10的值增加，加到9999或超过，均显示超出的数，同上k1双击处理。
6. 如当前值为1200，则连击时，显示值为 1210 1220 1230……..
7. K2连击 数码管上的以步长为10的值增加，减到0或超过，均显示超出的数，同上k2双击处理。
8. 如当前值为1200，则连击时，显示值为 1190 1180 1170……..
9. K3 功能键 ，类似于shift
当按住k3,再按下k1,k2时，数码管显示以步长100的速度增减，显示处理同上
10. 无击 10秒后，数码显示为0000
11. K4 三击 数码管显示-Function:
----------------------------------------------------------------
With four key control of four digital display
Four buttons respectively, erp k1, k2 and k4.
Functions:
1 K1 click on display, digital pipe number 1, add to 9999, then click, display 0000
2 K2 click on the number of digital pipe showed reduced to 1, and then click 0000, display 9999
3 K1 double-click on the display of digital tube number 5, to more than 999, after that the number and double-click beyond that, if present, for 9998, 4. After double-click
4 K2 double-click on the number of digital tube that 5, to reduce after more than 0, then double-click the number and beyond, display, such as the current and 999 for 1, after that, 9995 double-click on
5 combo digital pipe K1 by incrementing 10, plus the value increases to 9999 or over, all show beyond number, alexandrine K1 double-click processing.
6 if the value is 1200, when the display value, for the combo 1210 1220 1230... ..
7. K2 combo digita
Platform: |
Size: 3072 |
Author: leiyin |
Hits:
Description: vijos 1180 动态规划。欢迎各种交流讨论。-dynamic programming vijos 1180. Welcome to the various exchanges and discussions.
Platform: |
Size: 1024 |
Author: violet |
Hits:
Description: 校友通讯录查询系统，用三个十字交叉链表完成，包括查询统计编辑删除-校友通讯录查询系统
Platform: |
Size: 9216 |
Author: lan4062840 |
Hits:
Description: 软件介绍
TimeSpace工作室设计提供的一个CGI留言本
Tags： TimeSpace工作室设计留言本-Software introduction
TimeSpace studio designed to provide a CGI message
TimeSpace Tags: studio design studio
Platform: |
Size: 18432 |
Author: dmpudn91 |
Hits:
Description: 2017年06月16日，加利福尼亚大学的Dominique Zosso教授提出的极小曲面分割图像处理算法，经验证该算法能够实现对二维图像的合理模态分割，具有较好的使用价值文章参考：Dominique Zosso, Braxton Osting, "A minimal surface criterion for graph partitioning", Inverse Problems and Imaging 10(4):1149-1180, 2016.(06 2017 16, Professor Dominique zosso of University of California proposed minimal surface segmentation of the image processing algorithm, the algorithm can realize the reasonable mode of the two-dimensional image segmentation, with better value reference: Dominique zosso, Braxton the osting, "a minimal surface criterion for graph partitioning inverse and imaging (problems, 10 4): 1149-1180, 2016.)
Platform: |
Size: 45056 |
Author: Dex000
|
Hits: