Uva 1315 - Crazy tea party 解题报告（找规律）

关注

原创最新推荐文章于 2022-06-02 17:14:24 发布 3.6k 阅读 AI 写同款· GEO 优化 ›

uva 1315 - Crazy tea party(数论) 题目链接：uva 1315 - Crazy tea party 题目大意：有n个人顺时针为成一圈，现在相邻的两个人可以互相交换位置，问说最少交换几次可以使得n个人逆时针坐。解题思路：大概这样的策略师最优的，离1近的从1这边走，离n近的从n这边走。阅读详情

1315 - Crazy tea party

Time limit: 3.000 seconds

n participants of �crazy tea party� sit around the table. Each minute one pair of neighbors can change their places. Find the minimum time (in minutes) required for all participants to sit in reverse order (so that left neighbors would become right, and right - left).

Input

The first line is the amount of tests. Each next line contains one integer n (1 <= n <= 32767) - the amount of crazy tea participants.

Output

For each number n of participants to crazy tea party print on the standard output, on a separate line, the minimum time required for all participants to sit in reverse order.

Sample Input

Sample Output

2
4
6

解题报告：将n个参与者的顺序反向，每次只能交换相邻的两个人。

分析一下，1个人和2个人的时候不用操作，3个人的时候将2，3调换顺序即可。4个人的时候将1，2互换，3，4互换。

这么来看，每次我们将n个人分成n/2和n-n/2两组，每组都要反向。递推一下可知，反响一段m长度的序列需要m*(m-1)/2次操作。故代码如下：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int cal(int n)
{
    return n*(n-1)/2;
}

void work()
{
    int n;
    scanf("%d",&n);

    printf("%d\n", cal(n/2)+cal(n-n/2));
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
        work();
}

收录于