CodeForces - 366B Dima and To-do List (模拟) 水

CodeForces - 366B Dima and To-do List Time Limit: 1000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u Submit Status Description You helped Dima to have a great weekend, but it's time to work. Naturally, Dima, as all other men who have girlfriends, does everything wrong. Inna and Dima are now in one room. Inna tells Dima off for everything he does in her presence. After Inna tells him off for something, she goes to another room, walks there in circles muttering about how useless her sweetheart is. During that time Dima has time to peacefully complete k - 1 tasks. Then Inna returns and tells Dima off for the next task he does in her presence and goes to another room again. It continues until Dima is through with his tasks. Overall, Dima has n tasks to do, each task has a unique number from 1 to n. Dima loves order, so he does tasks consecutively, starting from some task. For example, if Dima has 6 tasks to do in total, then, if he starts from the 5-th task, the order is like that: first Dima does the 5-th task, then the 6-th one, then the 1-st one, then the 2-nd one, then the 3-rd one, then the 4-th one. Inna tells Dima off (only lovingly and appropriately!) so often and systematically that he's very well learned the power with which she tells him off for each task. Help Dima choose the first task so that in total he gets told off with as little power as possible. Input The first line of the input contains two integers n, k (1 ≤ k ≤ n ≤ 105). The second line contains n integersa1, a2, ..., an (1 ≤ ai ≤ 103), where ai is the power Inna tells Dima off with if she is present in the room while he is doing the i-th task. It is guaranteed that n is divisible by k. Output In a single line print the number of the task Dima should start with to get told off with as little power as possible. If there are multiple solutions, print the one with the minimum number of the first task to do. Sample Input Input 6 2 3 2 1 6 5 4 Output 1 Input 10 5 1 3 5 7 9 9 4 1 8 5 Output 3 Hint Explanation of the first example. If Dima starts from the first task, Inna tells him off with power 3, then Dima can do one more task (as k = 2), then Inna tells him off for the third task with power 1, then she tells him off for the fifth task with power 5. Thus, Dima gets told off with total power 3 + 1 + 5 = 9. If Dima started from the second task, for example, then Inna would tell him off for tasks 2, 4 and 6 with power 2 + 6 + 4 = 12. Explanation of the second example. In the second example k = 5, thus, Dima manages to complete 4 tasks in-between the telling off sessions. Thus, Inna tells Dima off for tasks number 1 and 6 (if he starts from 1 or 6), 2 and 7 (if he starts from 2 or 7) and so on. The optimal answer is to start from task 3 or 8, 3 has a smaller number, so the answer is 3. 题意太难读懂了，读了半个小时还有点模模糊糊，写了代码一交竟然AC了（^_^）,这才敢确定自己读懂题意了（英语太差。。。）下面换一种解释应该更好理解这个题的意思。有错误的见谅。。 //题意：输入n,k,   接着再输入n个数表示n本书的价格。 有n本书，每本书都有一个价格，现在你得买n/k本书，但是有一个规定：每一本书都有一个编号（从1到n），你买的n/k本书的编号必须是编号相差k的整数倍，比如n=6，k=2，表示有6本书，你得买6/2=3本书，你可以买编号为1,3,5或者买编号为2,4,6的书。 现在问怎样买可以使得花费最小。输出买的第一本书的编号（因为知道了第一本的编号，后面的编号也就确定了）。 //知道题意，这个题就太简单了，思路就没什么好说了，直接上代码。 #include<stdio.h> #include<string.h> #include<algorithm> #include<iostream> #define INF 0x3f3f3f3f #define ull unsigned long long #define ll long long #define IN __int64 #define N 100010 #define M 1000000007 int a[N]; int main() { int n,k,i,j; while(scanf("%d%d",&n,&k)!=EOF) { for(i=1;i<=n;i++) scanf("%d",&a[i]); int sum,mm=INF,p; for(i=1;i<=k;i++) { sum=0; for(j=i;j<=n;j+=k) { sum+=a[j]; } if(sum<mm) { mm=sum; p=i; } } printf("%d\n",p); } return 0; }