Welcome   HUNAN NORMAL UNIVERSITY ACM/ICPC Judge Online
Home
FAQs
Problem Set
Practices
Online Contests
Major Exercises
OI Special
Judgement
Submit
Online Status
User Ranklist
Users
Register new
Login
Web Links
Hunan Normal University
College of Information Science and Engineering
Hamburger String
Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB
Total submit users: 52, Accepted users: 50
Problem 10865 : No special judgement
Problem description
  BUG is a famous burger shop. Lots of costumers wait for burgers outside the burger every morning, because those hamburgers are so unforgettable.

Costumers stand in a queue, they come one by one, the latest one join into the end.

When a costumer(A) come to the end of the queue, if there’s already someone(B), wearing the same color as him, people between them(including A and B, called Hamburger String) will be served.

Served people leave the queue immediately.

N people come one by one, given their colors, can you tell me how many Hamburger Strings are there?

Input
  The first line is an integer T(T<=100).

Each case has an integer N(N<=100) in the first line.

Then N positive integers(<=20) follow, each corresponds a kind of color.

1 for red, 2 for yellow, and so on.

Output
  For each case output a single integer, indicating the number of Hamburger Strings are served.



Sample Input
3
1
1
2
2 2
10
1 2 3 4 3 1 2 4 1 5
Sample Output
0
1
2
Problem Source
  2011ACM国际大学生程序设计竞赛湘潭邀请赛

Submit   Discuss   Judge Status  Problems  Ranklist 

HUNAN NORMAL UNIVERSITY ACM/ICPC Judge Online, Version 2010.5.5.final.
Web visits:18402 today,16241393 total, since 2010-05-07