题目链接:

http://codeforces.com/contest/103/problem/D

D. Time to Raid Cowavans

time limit per test:4 seconds
memory limit per test:70 megabytes
#### 问题描述
> As you know, the most intelligent beings on the Earth are, of course, cows. This conclusion was reached long ago by the Martian aliens, as well as a number of other intelligent civilizations from outer space.
>
> Sometimes cows gather into cowavans. This seems to be seasonal. But at this time the cows become passive and react poorly to external stimuli. A cowavan is a perfect target for the Martian scientific saucer, it's time for large-scale abductions, or, as the Martians say, raids. Simply put, a cowavan is a set of cows in a row.
>
> If we number all cows in the cowavan with positive integers from 1 to n, then we can formalize the popular model of abduction, known as the (a, b)-Cowavan Raid: first they steal a cow number a, then number a + b, then — number a + 2·b, and so on, until the number of an abducted cow exceeds n. During one raid the cows are not renumbered.
>
> The aliens would be happy to place all the cows on board of their hospitable ship, but unfortunately, the amount of cargo space is very, very limited. The researchers, knowing the mass of each cow in the cowavan, made p scenarios of the (a, b)-raid. Now they want to identify the following thing for each scenario individually: what total mass of pure beef will get on board of the ship. All the scenarios are independent, in the process of performing the calculations the cows are not being stolen.
#### 输入
> The first line contains the only positive integer n (1 ≤ n ≤ 3·105) — the number of cows in the cowavan.
>
> The second number contains n positive integer wi, separated by spaces, where the i-th number describes the mass of the i-th cow in the cowavan (1 ≤ wi ≤ 109).
>
> The third line contains the only positive integer p — the number of scenarios of (a, b)-raids (1 ≤ p ≤ 3·105).
>
> Each following line contains integer parameters a and b of the corresponding scenario (1 ≤ a, b ≤ n).
#### 输出
> Print for each scenario of the (a, b)-raid the total mass of cows, that can be stolen using only this scenario.
>
> Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams of the %I64d specificator.
#### 样例
> **sample input**
> 4
> 2 3 5 7
> 3
> 1 3
> 2 3
> 2 2
>
> **sample output**
> 9
> 3
> 10

题意

给你n个数字的数组arr[],q个查询,对每个查询a,b,求数列和sigma(arr[a]+arr[a+b]+...)。

题解

这里用到了分块的思想:

如果所有的b都不相同你直接暴力也是可以做出来的(每次都按定义求和就好了),为什么呢,因为对于b>=sqrt(n)的,我们每次求和的时间<=sqrt(n),时间复杂度为q1 * sqrt(n);而对于小于等于sqrt(n)的b最多只有sqrt(n)个,我们每个查询求和最大的时间为o(n),时间复杂度为O(n * sqrt(n))。

如果很多b相同怎么办?首先,如果b>=sqrt(n),我们完全可以暴力做,所以我们只要考虑很多b相同并且b<sqrt(n)的情况。我们可以考虑离线处理,把相同的b都集中在一起,对所有相同的b我们只要O(n)处理一次步长为b的前缀和就可以了,这样,我们处理b<=sqrt(n)的情况就有能控制在O(n*sqrt(n))了。

代码

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define X first
#define Y second
#define mkp make_pair
using namespace std; typedef __int64 LL; const int maxn = 3e5 + 10; struct Node {
int id, a, b;
LL ans;
bool operator < (const Node& tmp) const {
return id < tmp.id;
}
}que[maxn]; bool cmp(const Node& n1, const Node& n2) {
return n1.b < n2.b;
} LL arr[maxn];
int n, q; LL sumv[maxn];
int len;
LL solve(int a, int b) {
if (b == len) {
return sumv[a];
}
else {
for (int i = n; i >= 1; i--) {
if (i + b > n) {
sumv[i] = arr[i];
}
else {
sumv[i] = arr[i] + sumv[i + b];
}
}
len = b;
return sumv[a];
}
} int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%I64d", &arr[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
int a, b;
scanf("%d%d", &que[i].a, &que[i].b);
que[i].id = i;
}
sort(que, que + q, cmp);
len = -1;
for (int i = 0; i < q; i++) {
int a = que[i].a, b = que[i].b;
LL ans = 0;
if (b < sqrt(n)) {
ans = solve(a, b);
}
else {
for (int i = a; i <= n; i += b) {
ans += arr[i];
}
}
que[i].ans = ans;
}
sort(que, que + q);
for (int i = 0; i < q; i++) {
printf("%I64d\n", que[i].ans);
}
return 0;
}

Codeforces Beta Round #80 (Div. 1 Only) D. Time to Raid Cowavans 离线+分块的更多相关文章

  1. Codeforces Beta Round #80 (Div. 1 Only) D. Time to Raid Cowavans 分块

    D. Turtles Time Limit: 20 Sec  Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/103/problem/D ...

  2. Codeforces Beta Round #80 (Div. 2 Only)【ABCD】

    Codeforces Beta Round #80 (Div. 2 Only) A Blackjack1 题意 一共52张扑克,A代表1或者11,2-10表示自己的数字,其他都表示10 现在你已经有一 ...

  3. 分治思想 特别常用 Codeforces Beta Round #80 (Div. 1 Only) D

    D. Time to Raid Cowavans time limit per test 4 seconds memory limit per test 70 megabytes input stan ...

  4. Codeforces Beta Round #69 (Div. 2 Only)

    Codeforces Beta Round #69 (Div. 2 Only) http://codeforces.com/contest/80 A #include<bits/stdc++.h ...

  5. Codeforces Beta Round #83 (Div. 1 Only)题解【ABCD】

    Codeforces Beta Round #83 (Div. 1 Only) A. Dorm Water Supply 题意 给你一个n点m边的图,保证每个点的入度和出度最多为1 如果这个点入度为0 ...

  6. Codeforces Beta Round #79 (Div. 2 Only)

    Codeforces Beta Round #79 (Div. 2 Only) http://codeforces.com/contest/102 A #include<bits/stdc++. ...

  7. Codeforces Beta Round #77 (Div. 2 Only)

    Codeforces Beta Round #77 (Div. 2 Only) http://codeforces.com/contest/96 A #include<bits/stdc++.h ...

  8. Codeforces Beta Round #76 (Div. 2 Only)

    Codeforces Beta Round #76 (Div. 2 Only) http://codeforces.com/contest/94 A #include<bits/stdc++.h ...

  9. Codeforces Beta Round #75 (Div. 2 Only)

    Codeforces Beta Round #75 (Div. 2 Only) http://codeforces.com/contest/92 A #include<iostream> ...

随机推荐

  1. 标签栏控制器(UITabBarController)

    一.标签栏控制器基础 1.绪论 a.一个标签栏是一个独立的界面对象,它经常与一个视图控制器(UITabBarController是UIViewController的子类)一起使用. b.一个标签栏项目 ...

  2. datagridview添加复选框全选和取消

    全选 private void All_selected_Click(object sender, EventArgs e) { ; i < this.DataGridViewProduct.R ...

  3. Html辅助方法(分页、下拉框)

    引用命名空间: using System.Text; using System.Web.Mvc; Html分页方法 #region 分页Html辅助方法 /// <summary> /// ...

  4. [原创] 初识Agile/CMMI/Scrum

    一.背景介绍 在朋友(aehyok)的建议下,初步去了解Visual Studio Online,简称VS Online(即原来的 Team Foundation Service,简称TFS) VS ...

  5. js一些稀奇古怪的写法-带你装逼带你飞

    //定时器的第三个参数 setInterval(function(str1,str2,num){ alert(str1+str2+num) },1000,'参数1','还可以有很多参数,不同的类型.. ...

  6. apache2反向代理node.js应用

    在之前记录的随笔中,只是介绍了怎么在apache2中使用proxy模块,后来查到了一些资料,可以通过下面网址查看配置块的详细参数信息 http://man.ddvip.com/soft/apache2 ...

  7. 添加TextView隐藏进度条的方法

    在TextView中添加 android:scrollbars="vertical" android:singleLine="false" 在Activity代 ...

  8. Python学习教程(learning Python)--1.2.3 Python格式化输出百分比

    在有些情况下,需要百分比输出数据,我们可以继续使用Python内建函数format来实现百分比的数据输出. >>> print(format(0.5236, '.2%')) 其结果如 ...

  9. cygwin

    setup-x86_64 -q -P wget,tar,qawk,bzip2,subversion,vim wget rawgit.com/transcode-open/apt-cyg/master/ ...

  10. 使用 libevent 和 libev 提高网络应用性能——I/O模型演进变化史

    构建现代的服务器应用程序需要以某种方法同时接收数百.数千甚至数万个事件,无论它们是内部请求还是网络连接,都要有效地处理它们的操作. 有许多解决方案,但事件驱动也被广泛应用到网络编程中.并大规模部署在高 ...