满月照亮的路

Let us define a regular brackets sequence in the following way: 1. Empty sequence is a regular sequence. 2. If S is a regular sequence, then (S) and [S] are both regular sequences. 3. If A and B are r...

You have to cut a wood stick into pieces. The most affordable company, The Analog Cutting Machinery, Inc. (ACM), charges money according to the length of the stick being cut. Their procedure of work re...

Optimal Array Multiplication Sequence Time Limit: 2 Seconds      Memory Limit: 65536 KB      ...

题目链接：http://codeforces.com/contest/1114/problem/D题目大意：给定一个数字序列，规定连通区域为数字相同且位置连续的一个块，然后初始可以指定一个位置且位置固定，可以操作把当前连通块的颜色变化，问要把序列变成一个连通块，其最小操作数是多少。题目分析：本来我是想用数据结构来维护的，因为我发现，一个位置被括号数字对包含了多少次其变色次数就...