题目链接:http://codeforces.com/contest/731/problem/F

F. Video Cards
time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Little Vlad is fond of popular computer game Bota-2. Recently, the developers announced the new add-on named Bota-3. Of course, Vlad immediately bought only to find out his computer is too old for the new game and needs to be updated.

There are n video cards in the shop, the power of the i-th
video card is equal to integer value ai.
As Vlad wants to be sure the new game will work he wants to buy not one, but several video cards and unite their powers using the cutting-edge technology. To use this technology one of the cards is chosen as the leading one and other video cards are attached
to it as secondary. For this new technology to work it's required that the power of each of the secondary video cards is divisible by the power of the leading video card. In order to achieve that the power of any secondary video card can be reduced to any
integer value less or equal than the current power. However, the power of the leading video card should remain unchanged, i.e. it can't be reduced.

Vlad has an infinite amount of money so he can buy any set of video cards. Help him determine which video cards he should buy such that after picking the leading video card and may be reducing some powers of others to make them work together he will get the
maximum total value of video power.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) —
the number of video cards in the shop.

The second line contains n integers a1, a2,
..., an (1 ≤ ai ≤ 200 000) —
powers of video cards.

Output

The only line of the output should contain one integer value — the maximum possible total power of video cards working together.

Examples
input
4
3 2 15 9
output
27
input
4
8 2 2 7
output
18
Note

In the first sample, it would be optimal to buy video cards with powers 3, 15 and 9.
The video card with power 3 should be chosen as the leading one and all other video cards will be compatible with it. Thus, the total power
would be 3 + 15 + 9 = 27. If he buys all the video cards and pick the one with the power 2 as
the leading, the powers of all other video cards should be reduced by 1, thus the total power would be 2 + 2 + 14 + 8 = 26,
that is less than 27. Please note, that it's not allowed to reduce the power of the leading video card, i.e. one can't get the total power 3 + 1 + 15 + 9 = 28.

In the second sample, the optimal answer is to buy all video cards and pick the one with the power 2 as the leading. The video card with the
power 7 needs it power to be reduced down to 6.
The total power would be 8 + 2 + 2 + 6 = 18.

题意:

给定n个数,在其中选择1个数,使得其他数经过自减后能够被它整除,求经过处理后,这n个数之和所能达到的最大值?

题解:

1.sum[]数组记录a[i]的个数,即为sum[a[i]]。

2.对sum[]数组求后缀和。则sum[i]为:在这n个数之中,大小能够达到i(>=i)的个数。

3.可以形象地把这n个数想象成n条长度分别为a[i]的木棍,然后把这n条木棍左对齐,而sum[len]即为长度>=len的木棍条数。

4.当被选中的数为a[i]时,就依次在长度为a[i]*k的位置上切一刀,得到sum[a[i]*k]条木棍,每条木棍长度为a[i], 那么总和 tmp += sum[a[i]*k]*a[i]  (k=1,2,3,4……,a[i]<=a[i]*k<=最长的那条木棍)。然后枚举a[i],取ans = max(tmp);

注意:如果a[i]是a[j]的倍数,那么a[i]就没有枚举的必要了,因为a[i]的情况已经包含于a[j]里面了。即:a[i]情况下的tmp<=a[j]情况下的tmp。所以加个vis[]数组。

学习之处:

1.以后看到数据范围在 200,000 之内的,可以考虑开大小为 200,000 的数组,实现y=x的映射。

2.前缀和的逆向求和,即后缀和sum[val]。其表示为:大小能够达到val的数的个数。

代码如下:

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const double eps = 1e-6;
const int INF = 2e9;
const LL LNF = 9e18;
const int mod = 1e9+7;
const int maxn = 2e5+10; int n, N, a[maxn], sum[maxn];
bool vis[maxn]; void init()
{
memset(sum,0,sizeof(sum));
memset(vis,0,sizeof(vis)); scanf("%d",&n);
for(int i = 1; i<=n; i++)
{
scanf("%d",&a[i]);
sum[a[i]]++;
}
sort(a+1, a+1+n);
for(int i = a[n]-1; i>0; i--)
sum[i] += sum[i+1];
} int solve()
{
LL ans = 0;
for(int i = 1; i<=n; i++)
{
int len = a[i];
if(vis[len]) continue; LL tmp = 0;
for(int pos = len; pos<=a[n]; pos += len)
{
tmp += 1LL*sum[pos]*len;
vis[pos] = 1;
}
ans = max(ans, tmp);
}
cout<<ans<<endl;
} int main()
{
init();
solve();
}

Codeforces Round #376 (Div. 2) F. Video Cards —— 前缀和 & 后缀和的更多相关文章

  1. Codeforces Round #376 (Div. 2) F. Video Cards 数学,前缀和

    F. Video Cards time limit per test 1 second memory limit per test 256 megabytes input standard input ...

  2. Codeforces Round #376 (Div. 2)F. Video Cards(前缀和)

    题目链接:http://codeforces.com/contest/731/problem/F 题意:有n个数,从里面选出来一个作为第一个,然后剩下的数要满足是这个数的倍数,如果不是,只能减小为他的 ...

  3. Codeforces Round #376 (Div. 2) F. Video Cards 数学 & 暴力

    http://codeforces.com/contest/731/problem/F 注意到一个事实,如果你要找一段区间中(从小到大的),有多少个数是能整除左端点L的,就是[L, R]这样.那么,很 ...

  4. Codeforces Round #552 (Div. 3) F. Shovels Shop (前缀和预处理+贪心+dp)

    题目:http://codeforces.com/contest/1154/problem/F 题意:给你n个商品,然后还有m个特价活动,你买满x件就把你当前的x件中最便宜的y件价格免费,问你买k件花 ...

  5. Codeforces Round #485 (Div. 2) F. AND Graph

    Codeforces Round #485 (Div. 2) F. AND Graph 题目连接: http://codeforces.com/contest/987/problem/F Descri ...

  6. Codeforces Round #486 (Div. 3) F. Rain and Umbrellas

    Codeforces Round #486 (Div. 3) F. Rain and Umbrellas 题目连接: http://codeforces.com/group/T0ITBvoeEx/co ...

  7. Codeforces Round #501 (Div. 3) F. Bracket Substring

    题目链接 Codeforces Round #501 (Div. 3) F. Bracket Substring 题解 官方题解 http://codeforces.com/blog/entry/60 ...

  8. Codeforces Round #499 (Div. 1) F. Tree

    Codeforces Round #499 (Div. 1) F. Tree 题目链接 \(\rm CodeForces\):https://codeforces.com/contest/1010/p ...

  9. Codeforces Round #490 (Div. 3) :F. Cards and Joy(组合背包)

    题目连接:http://codeforces.com/contest/999/problem/F 解题心得: 题意说的很复杂,就是n个人玩游戏,每个人可以得到k张卡片,每个卡片上有一个数字,每个人有一 ...

随机推荐

  1. 洛谷—— P3865 【模板】ST表

    https://www.luogu.org/problemnew/show/P3865 题目背景 这是一道ST表经典题——静态区间最大值 请注意最大数据时限只有0.8s,数据强度不低,请务必保证你的每 ...

  2. Xamarin.Forms的滚动视图ScrollView

    Xamarin.Forms的滚动视图ScrollView   在Xamarin.Forms中,滚动视图ScrollView用来实现长内容的滚动显示.虽然ScrollView的Content属性只能设置 ...

  3. .net 哈希

    using System; using System.Collections.Generic; using System.Linq; using System.Security.Cryptograph ...

  4. 用hashmap实现自己的缓存

    @SuppressWarnings({"unchecked", "rawtypes"})public class DefaultCache implements ...

  5. openfire Android学习(一)----实现用户注册、登录、修改密码和注销等

    以前学习过用Scoket 建立聊天,简单的建立聊天是没问题的,但如果要实现多人复杂的聊天,后台服务器代码就比较复杂,对于我这新手来讲就比较难了.后来在网上看到用openfire做服务器,利用强大的Sm ...

  6. IDEA Java/Scala混合项目maven打包

    1.首先创建maven项目 2.创建成功后新建class,只有java的,没有scala的 3.修改pom.xml文件,引入scala <?xml version="1.0" ...

  7. Unity3D:Gizmos画圆(原创)

    Unity3D引擎技术交流QQ群:[21568554] Gizmos是场景视图里的一个可视化调试工具. 在做项目过程中.我们常常会用到它,比如:绘制一条射线等. Unity3D 4.2版本号截至.眼下 ...

  8. 辛星浅析raid

    我们来分析一下影响计算机性能的主要组件,主要就是CPU.主板的总线IO.内存IO.硬盘IO.网卡IO等等,并且如今CPU的性能已经非常好了,可是计算机的总体的IO性能却较低,严重影响了计算机的性能,如 ...

  9. OpenCV入门笔记(一) Linux下的安装

    关于OpenCV,有中文的官方站点.里面翻译了官网的教程和API等.中文官方Tutorials见这里:[Tutorials] 一.Ubuntu下的安装 能够选择直接从库里安装,或者手动编译安装,请參考 ...

  10. Heap &amp; Priority Queue

    Heap & Priority Queue Definition & Description: In computer science/data structures, a prior ...