SPOJ NWERC11E Please, go first

Please, go first

You are currently on a skiing trip with a group of friends. In general, it is going well: you enjoy the skiing during the day and, of course, the après-skiing during the night. However, there is one nuisance: the skiing lift. As always, it is too small, and can only serve one person every 5 seconds. To make matters worse, you and your friends generally don’t arrive simultaneously at the lift, which means that you spend time waiting at the bottom of the mountain for the lift and at the top again for your friends.

The waiting at the top is especially inefficient. In fact, you realize that if your friends haven’t arrived yet, you might as well let other people pass you in the queue. For you, it makes no difference, since otherwise you’d be waiting at the top. On the other hand, your actions might save them time if their friends have already arrived and are currently waiting for them at the top.

You are wondering how much time would be saved if everybody adopts this nice attitude. You have carefully observed the queue for a while and noticed which persons form groups of friends. Suppose someone lets another pass if doing this doesn’t change his own total waiting time, but saves time for the other person. Do this over and over again until it can’t be done anymore. How much time will this save, in total?

 

Input

On the first line a positive integer: the number of test cases, at most 100. After that per test case:

• one line with an integer n (1 ≤ n ≤ 25 000): the number of people in the line for the lift.
• one line with n alphanumeric characters (uppercase and lowercase letters and numbers): the queue. The first person in this line corresponds to the person at the head of the queue. Equal characters correspond to persons from the same group of friends.

 

Output

Per test case:

• one line with an integer: the time saved, in seconds.

 

Sample in- and output

Input	Output
2 6 AABABB 10 Ab9AAb2bC2	15 45

这题太坑了 要靠自己理解    给你一队人 先求出原来的时间 再求出排好队之后的时间 求差

原来的人要等之前的人才一起上山  比如第二组的2有一个排在最后 所以 2要等最前面的人都走了才上 要等9个而且有2个2 所以时间为2*5*9

前面的2的时间不用算入了 这是最差的时间

优化的话  结果是9AAABBBC22 虽然2还是要等9个人朋友也要等9个人 但是C之前要等8个人 现在只要7人 同理

#include <stdio.h>
#include <string.h>
int main()
{
    int cas,n,sum[300],i;
    char a[25005];
    scanf("%d",&cas);
    while(cas--)
    {
        scanf("%d %s",&n,a);
        memset(sum,0,sizeof sum);
        for(i=0;a[i]!=0;i++)
            sum[a[i]]++;
        int ans1=0,ans2=0;
        for(i=n-1;i>=0;i--)
        {
            if(sum[a[i]])
            {
                ans1+=i*5*sum[a[i]];
                ans2+=(n-1)*5*sum[a[i]];
                n-=sum[a[i]];
                sum[a[i]]=0;
            }
        }
        printf("%d\n",ans1-ans2);
    }
    return 0;
}