给一个排列加上表示循环的括号,问如何让1到n的对应的字典序最大.
从1开始贪心每个数字可以往三个地方走,右边第一个,跳转到左边的某一个,和自己构成循环
对于走到右边第一个的情况,只要判断右边的那个有没有被占据就可以了,如果可以huan
跳转到左边的某一个,用一个线段树查询区间里的最大值
ZZX and Permutations
Time Limit: 60...
分类:
编程语言 时间:
2015-08-03 22:44:08
阅读次数:
214
Dragon BallsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4384Accepted Submission(s): 1673Proble...
分类:
其他好文 时间:
2015-08-03 22:16:53
阅读次数:
106
Square Coins
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9761 Accepted Submission(s): 6692
Problem Description
People in Sil...
分类:
其他好文 时间:
2015-08-03 21:02:00
阅读次数:
128
OulipoTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7141Accepted Submission(s): 2835Problem Desc...
分类:
其他好文 时间:
2015-08-03 20:50:15
阅读次数:
103
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 18094 Accepted Submission(s): 10431
Problem Description
The GeoSurv...
分类:
其他好文 时间:
2015-08-03 19:25:26
阅读次数:
139
1506的加强版
City Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5587 Accepted Submission(s): 2412
Problem Description
Bob is a strate...
分类:
其他好文 时间:
2015-08-03 19:23:47
阅读次数:
115
Largest Rectangle in a Histogram
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14050 Accepted Submission(s): 4008
Problem Description
A...
分类:
其他好文 时间:
2015-08-03 19:22:44
阅读次数:
136
Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 28852 Accepted Submission(s): 10143
Problem Description
Nowadays, we all...
分类:
其他好文 时间:
2015-08-03 19:11:10
阅读次数:
120
N皇后问题
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 12904 Accepted Submission(s): 5811
Problem Description
在N*N的方格棋盘放置了N个皇后,使得它们...
分类:
其他好文 时间:
2015-08-03 14:38:47
阅读次数:
89
构造
小于10^5的直接输出1
大于10^5的构造如下的串
1111...12222...233....3.....t,t+1,t+2..
设长度为n,每种字符出现了L[i]次则不同的串有 n*n+n-sigma(L[i])=2*K
大约估计一个n,用贪心求出L
Virtual Participation
Time Limit: 2000/1000 MS (Java...
分类:
其他好文 时间:
2015-08-03 14:30:14
阅读次数:
176