数组

Problem Description

Array is frequently used when we are programing. We are familiar with it. Here is a problem about array. 

Do enjoy it and try your best to solve it.
Assume there is an array: a[1],a[2],...a[n](a[i] is positive integer, 1<=i<=n) and a[i]<=a[j](1<=i<j<=n)
Now we define another array:b[1],b[2],...,b[a[n]
b[i]=min{v|a[v]>=i},1<=i<=a[n]
Finally, the problem is: given the value[n+a[n]), you have to find the maximum of (a[1]+a[2]+...+a[n]+

b[1]+b[2]+...+b[a[n]]).

Input

The first line of the input is a positive integer T. T is the number of the test cases followed. Each test case 

contains an integer V(1<V<10000) which tell you the value(n+a[n]). There may be one or several spaces 

before or after the integer.

Output

The output of the problem should consist of one line of output for each test case.
The output of each test case only contains one integer M, M is the maximum of (a[1]+a[2]+...+a[n]+

b[1]+b[2]+...+b[a[n]]). No any redundant space is needed.

Sample Input

2
2
3

Sample Output

2
4

/*

解题报告：给出V(n+a[n]), 由题可知 a[n] >= n， 如果V是奇数，a[v/2] = v/2+1;

             如果是偶数，则a[v/2] = v/2;      

             题中有b[i]=min{v|a[v]>=i},1<=i<=a[n],    只有当a[i] = i（1<=i<=v/2）, 

             b[i]可以取最大值,则最后a[1]+....+a[n] + b[1]+....+b[a[n]] 最大。

*/

//标程：

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
// 	freopen("a.txt","r",stdin);
    int t, n;
	cin >> t;
	while(t --)
	{
		cin >> n;
		int sum = 0, i;
	        for(i = 1; i <= n/2; i ++)
			sum += 2*i;
		if(n%2==1) sum += (n/2+1);
		cout << sum << endl;
	}
	return 0;
}