HDU 4655 Cut Pieces
来源:互联网 发布:php编程教程 编辑:程序博客网 时间:2024/04/30 02:55
Cut Pieces
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 69 Accepted Submission(s): 27
Problem Description
Suppose we have a sequence of n blocks. Then we paint the blocks. Each block should be painted a single color and block i can have color 1 to color ai. So there are a total of prod(ai) different ways to color the blocks.
Consider one way to color the blocks. We call a consecutive sequence of blocks with the same color a "piece". For example, sequence "Yellow Yellow Red" has two pieces and sequence "Yellow Red Blue Blue Yellow" has four pieces. What is S, the total number of pieces of all possible ways to color the blocks?
This is not your task. Your task is to permute the blocks (together with its corresponding ai) so that S is maximized.
Consider one way to color the blocks. We call a consecutive sequence of blocks with the same color a "piece". For example, sequence "Yellow Yellow Red" has two pieces and sequence "Yellow Red Blue Blue Yellow" has four pieces. What is S, the total number of pieces of all possible ways to color the blocks?
This is not your task. Your task is to permute the blocks (together with its corresponding ai) so that S is maximized.
Input
First line, number of test cases, T.
Following are 2*T lines. For every two lines, the first line is n, length of sequence; the second line contains n numbers, a1, ..., an.
Sum of all n <= 106.
All numbers in the input are positive integers no larger than 109.
Following are 2*T lines. For every two lines, the first line is n, length of sequence; the second line contains n numbers, a1, ..., an.
Sum of all n <= 106.
All numbers in the input are positive integers no larger than 109.
Output
Output contains T lines.
Each line contains one number, the answer to the corresponding test case.
Since the answers can be very large, you should output them modulo 109+7.
Each line contains one number, the answer to the corresponding test case.
Since the answers can be very large, you should output them modulo 109+7.
Sample Input
131 2 3
Sample Output
14HintBoth sequence 1 3 2 and sequence 2 3 1 result in an S of 14.
Source
2013 Multi-University Training Contest 6
Recommend
zhuyuanchen520
题意: 有N个数, 选择一种排列顺序, 算出最多能有多少块。
思路: 贪心
排序后,用滚动数组实现。
排序按最小, 最大, 次小, 次大, 依次排序。
比如 1 2 3 4 5 -> 1 5 2 4 3
然后递推公式。
#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>#include <vector>#include <cmath>using namespace std;//const int V = 1000000 + 50;const int MaxN = 80 + 5;const int mod = 1000000000 + 7;const __int64 INF = 0x7FFFFFFFFFFFFFFFLL;const int inf = 0x7fffffff;int T, n, num[V], ans[V];__int64 dp[V], sum[V];int main() { int i, j; scanf("%d", &T); while(T--) { scanf("%d", &n); for(i = 0; i < n; ++i) scanf("%d", &num[i]); sort(num, num + n); int ii = 0, jj = n - 1; for(i = 0; i < n; ++i) { if(i % 2 == 0) { ans[i] = num[ii]; ii++; } else { ans[i] = num[jj]; jj--; } } sum[n] = 1; sum[n - 1] = ans[n - 1]; dp[n - 1] = ans[n - 1]; for(i = n - 2; i >= 0; --i) { if(ans[i] >= ans[i + 1]) dp[i] = (ans[i] - ans[i + 1]) * (dp[i + 1] + sum[i + 1]) + (sum[i + 1] - sum[i + 2] + dp[i + 1]) * ans[i + 1]; else dp[i] = ans[i] * (dp[i + 1] + sum[i + 1] - sum[i + 2]); dp[i] %= mod; dp[i] = (dp[i] + mod) % mod; sum[i] = (sum[i + 1] * ans[i]) % mod; } printf("%d\n", dp[0]); }}
- hdu 4655 Cut Pieces
- HDU 4655 Cut Pieces
- HDU 4655 Cut Pieces
- hdu -4655 Cut Pieces
- hdu 4655 Cut Pieces
- HDU 4655 Cut Pieces
- HDU 4655 Cut Pieces
- hdu 4655——Cut Pieces
- hdu 4655 Cut Pieces (找规律)
- hdu 4655 Cut Pieces(DP 贪心)
- hdu 4655 Cut Pieces(贪心)
- HDU Cut Pieces (计数+求逆元)
- 2013 多校第六场 hdu 4655 Cut Pieces
- hdu 4655 Cut Pieces/杭电多校第六场1001 找规律,或者dp
- HDU 4655 2013多校联合赛第6场 Cut Pieces
- Cut Pieces (数学分析---杭电第六场)
- HDU 4628 Pieces
- HDU 4628 Pieces
- 树形控件(Tree)的使用
- Linux /bin, /sbin, /usr/bin, /usr/sbin 区别
- mysql命令语法2
- MyEclipse10在win7下字体显示问题
- 在存有10亿个数的文件中找到最大的100万个数
- HDU 4655 Cut Pieces
- C3P0异常处理
- 图片浏览
- ACE在CentOS下的编译
- python2.7使用suds库调用webservice
- 加载大图片,内存溢出问题
- iOS 隐藏键盘
- Mean Shift算法(CamShift)
- poj 1458 Common Subsequence