在Codehorses上，每天都有新的编程问题发布。Polycarp想要选择三天，使得中间一天的问题难度与第一天的难度之差等于最后一天与中间一天的难度之差。计算满足条件的组合数。输入包含测试用例，每个用例给出问题天数和各天的难度。输出每个测试用例的组合数。题目要求使用unordered_map优化算法。
Managing Difficulties
Every day a new programming problem is published on Codehorses. Thus, n problems will be published in the following n days: the difficulty of the ii-th problem is ai.
Polycarp wants to choose exactly three days i, j and k (i<j<k) so that the difference of difficulties on the day j and the day i is equal to the difference of difficulties on the day k and day j. In other words, Polycarp wants equality aj−ai=ak−aj to be true.
Determine the number of possible ways for Polycarp to choose the three days in the desired way.
Input
The first line contains an integer t — the number of test cases in the input (1≤t≤10). Then t test case descriptions follow.
The first line of a test case contains an integer n — the number of the days (3≤n≤2000).
The second line of the test case contains n integers a1,a2,…,an, where ai is the difficulty of the problem on the i-th day (1≤ai≤10^9).
Output
Output t integers — the answers for each of the test cases in the input, in the order they are given. The answer to a test case is the number of triples of indices i, j, and k such that 1≤i<j<k≤n and ak−aj=aj−ai.
Example
input
4
5
1 2 1 2 1
3
30 20 10
5
1 2 2 3 4
9
3 1 4 1 5 9 2 6 5
output
1
1
最低0.47元/天 解锁文章
扫一扫
1443
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
