1159B Expansion coefficient of the array

最新推荐文章于 2023-05-27 12:44:07 发布

原创最新推荐文章于 2023-05-27 12:44:07 发布 · 644 阅读

0 ·

CC 4.0 BY-SA版权

ACM日常水题练习集专栏收录该内容

307 篇文章

订阅专栏

本文探讨了一种算法问题，即寻找非负整数数组的扩张系数。通过分析数组元素之间的关系，确定一个最大的整数k，使得对于任意数组中的两个元素，k乘以它们的下标差绝对值小于等于这两个元素中的较小者。文章提供了问题描述、输入输出格式及示例，并附带了一个高效的算法解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

B. Expansion coefficient of the array

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Let's call an array of non-negative integers a1,a2,…,ana1,a2,…,an a kk-extension for some non-negative integer kk if for all possible pairs of indices 1≤i,j≤n1≤i,j≤n the inequality k⋅|i−j|≤min(ai,aj)k⋅|i−j|≤min(ai,aj) is satisfied. The expansion coefficient of the array aa is the maximal integer kk such that the array aa is a kk-extension. Any array is a 0-expansion, so the expansion coefficient always exists.

You are given an array of non-negative integers a1,a2,…,ana1,a2,…,an. Find its expansion coefficient.

Input

The first line contains one positive integer nn — the number of elements in the array aa (2≤n≤3000002≤n≤300000). The next line contains nn non-negative integers a1,a2,…,ana1,a2,…,an, separated by spaces (0≤ai≤1090≤ai≤109).

Output

Print one non-negative integer — expansion coefficient of the array a1,a2,…,ana1,a2,…,an.

Examples

input

Copy

4
6 4 5 5

output

Copy

input

Copy

3
0 1 2

output

Copy

input

Copy

4
821 500 479 717

output

Copy

Note

In the first test, the expansion coefficient of the array [6,4,5,5][6,4,5,5] is equal to 11 because |i−j|≤min(ai,aj)|i−j|≤min(ai,aj), because all elements of the array satisfy ai≥3ai≥3. On the other hand, this array isn't a 22-extension, because 6=2⋅|1−4|≤min(a1,a4)=56=2⋅|1−4|≤min(a1,a4)=5 is false.

In the second test, the expansion coefficient of the array [0,1,2][0,1,2] is equal to 00 because this array is not a 11-extension, but it is 00-extension.

题意：输入n，表示n个正整数，找出一个系数k，k满足所有k<=min(a[i],a[j])/|i-j|，也就是这个k是满足所有数取两个组成一对，取这一对中最小的值，然后除以下标索引差，因为是满足所有对数，那就是要让k尽量小，那就让i-j的下标索引值最大，这个题n是3*10^5如果暴力取对数，两成循环，9*10^9会超时。就要另辟蹊径。

题解：在计算每个数的贡献，因为对于这个数来说，如果它在一对数里面不算最小的，那它根本没影响，如果他是最小的，那么它能取到的最小值就是到两端的答案，如果当前你更新了这个答案，到最后一个位置那个数更小的话，答案也会被更新，没有影响。

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,x,ans=1<<30;
    cin>>n;
    for(int i=1;i<=n;i++)
        {
            cin>>x;
            ans=min(ans,x/max(i-1,n-i));
        }
        cout<<ans<<endl;
    return 0;
}