Codeforces Round #288 (Div. 2)C. Anya and Ghosts

这道题开始没做出来，鬼来的时间是一个递增数列，难点在如何判断在每一秒上，各个蜡烛燃烧几秒，是很难处理的！突破口是：让第一支蜡烛在第一个鬼来的的时间上亮，用数组time[]处理每个鬼的时间，在这个点到t秒内，时间都加1，然后向前递推蜡烛数！

Anya loves to watch horror movies. In the best traditions of horror, she will be visited by m ghosts tonight. Anya has lots of candles prepared for the visits, each candle can produce light for exactly t seconds. It takes the girl one second to light one candle. More formally, Anya can spend one second to light one candle, then this candle burns for exactly t seconds and then goes out and can no longer be used.

For each of the m ghosts Anya knows the time at which it comes: the i-th visit will happen w_i seconds after midnight, all w_i's are distinct. Each visit lasts exactly one second.

What is the minimum number of candles Anya should use so that during each visit, at least r candles are burning? Anya can start to light a candle at any time that is integer number of seconds from midnight, possibly, at the time before midnight. That means, she can start to light a candle integer number of seconds before midnight or integer number of seconds after a midnight, or in other words in any integer moment of time.

Input

The first line contains three integers m, t, r (1 ≤ m, t, r ≤ 300), representing the number of ghosts to visit Anya, the duration of a candle's burning and the minimum number of candles that should burn during each visit.

The next line contains m space-separated numbers w_i (1 ≤ i ≤ m, 1 ≤ w_i ≤ 300), the i-th of them repesents at what second after the midnight the i-th ghost will come. All w_i's are distinct, they follow in the strictly increasing order.

Output

If it is possible to make at least r candles burn during each visit, then print the minimum number of candles that Anya needs to light for that.

If that is impossible, print  - 1.

Sample test(s)

Input

1 8 3
10

Output

3

Input

2 10 1
5 8

Output

1

Input

1 1 3
10

Output

-1

#include<stdio.h>
#include<string.h>
int main()
{
    int ghost[1010],time[1010];
    int m,t,r;
    while(scanf("%d%d%d",&m,&t,&r)!=EOF)
    {
        memset(ghost,0,sizeof(ghost));
        memset(time,0,sizeof(time));
        for(int i=1;i<=m;i++)
        {
            scanf("%d",&ghost[i]);
        }
        if(r>t)
        {
            printf("-1\n");
            return 0;
        }
        int sum=0;
        for(int i=1;i<=m;i++)
        {
            for(int j=ghost[i];r-time[ghost[i]]>0;j--)
            {
                sum++;
                for(int k=0;k<t;k++)
                    if(k+j>=0)
                    time[k+j]++;
            }
        }
        printf("%d\n",sum);
    }
    return 0;
}