1103 : Taking Photo
- 时间限制Time Limit
- 2 秒Sec
- 内存限制Memory Limit
- 128 兆MB
- 提交次数Submitted
- 33 次Times
- 通过次数Solved
- 3 次Times
| 比对Compare | token 相同即通过。中间的空格、制表符、换行可多可少。Matching tokens pass. Extra spaces, tabs, or newlines between them are ignored. |
|---|---|
| 不同则错Differs | token 个数或内容不同即错误。23 与 2 3、02 与 2、2.0 与 2 均视为不同。A different token count or value is wrong. 23 vs 2 3, 02 vs 2, and 2.0 vs 2 all differ. |
| 输入Input | 标准输入,格式见题面。Standard input; format as in the statement. |
| 输出Output | 标准输出。Standard output. |
| 时间与内存Time and memory | 记这一份程序的 CPU 时间和内存峰值。题目上的时间限制、内存限制就是这一份的上限。The record is this program’s CPU time and peak memory. The limits on the problem apply to this one run. |
题目描述Description
There are some people from a company sitting in a line and waiting to take a group photo. For some reason, the people coming from the same department want to sit together, i.e., sit in some continuous seats. Note that the seats cannot be moved, but they can change seats with others. Now, they need your help to figure out the minimum number of people involved in changing seats.
输入格式Input
There will be at most 200 test cases. Each case begins with one integer n(3 ≤ n ≤ 30), the number of the people. The next line contains n integers xi(1 ≤ xi ≤ n), describing the department identifiers of the people from left to right. People with the same identifier belong to the same department.
输出格式Output
For each test case, print the minimum number of people involved in changing seats.
样例Sample
出题Author
Staginner