zoukankan      html  css  js  c++  java

  • HDU 5805 NanoApe Loves Sequence （模拟）

    NanoApe Loves Sequence

    题目链接：

    http://acm.hdu.edu.cn/showproblem.php?pid=5805

    Description

    NanoApe, the Retired Dog, has returned back to prepare for the National Higher Education Entrance Examination! In math class, NanoApe picked up sequences once again. He wrote down a sequence with n numbers on the paper and then randomly deleted a number in the sequence. After that, he calculated the maximum absolute value of the difference of each two adjacent remained numbers, denoted as F. Now he wants to know the expected value of F, if he deleted each number with equal probability.

    Input

    The first line of the input contains an integer T, denoting the number of test cases. In each test case, the first line of the input contains an integer n, denoting the length of the original sequence. The second line of the input contains n integers A1,A2,...,An, denoting the elements of the sequence. 1≤T≤10, 3≤n≤100000, 1≤Ai≤109

    Output

    For each test case, print a line with one integer, denoting the answer. In order to prevent using float number, you should print the answer multiplied by n.

    Sample Input

    1 4 1 2 3 4

    Sample Output

    6
    ##题意： 每次从数组中删除 Ai 并求相邻元素绝对值之差的最大值. (再把Ai放回来) 对以上最大值求和.
    ##题解： 直接模拟，分别记录位置i左边和右边的数构成的最大值. 结果就是：i左边、i右边、与i相邻两数差 这三者的最大值.
    ##代码： ``` cpp #include #include #include #include #include #include #include #include #include #include #include #define LL long long #define eps 1e-8 #define maxn 101000 #define mod 1000000007 #define inf 0x3f3f3f3f #define mid(a,b) ((a+b)>>1) #define IN freopen("in.txt","r",stdin); using namespace std;

    int n;
    int num[maxn];
    int _left[maxn];
    int _right[maxn];

    int main(void)
    {
    //IN;

    int t; cin >> t;
while(t--)
{
    scanf("%d", &n);
    for(int i=1; i<=n; i++) {
        scanf("%d", &num[i]);
    }

    memset(_left, 0, sizeof(_left));
    memset(_right, 0, sizeof(_right));

    for(int i=2; i<=n; i++) {
        _left[i] = max(_left[i-1], abs(num[i]-num[i-1]));
    }

    for(int i=n-1; i>=1; i--) {
        _right[i] = max(_right[i+1], abs(num[i]-num[i+1]));
    }

    LL ans = 0;
    for(int i=1; i<=n; i++) {
        int cur = max(_left[i-1], _right[i+1]);
        if(i!=1 && i!=n) cur = max(cur, abs(num[i+1]-num[i-1]));
        ans += (LL)cur;
    }

    printf("%lld
", ans);
}

return 0;

    }
  • 相关阅读:
    开发3dMax插件的方法和应用
    实现X*N
    fork与vfork的区别
    使用递归算法写一段程序
    宏和函数的区别
    多线程学习(一)
    [算法天天练]堆排序
    [转][算法天天练]堆与堆排序
    [转]快速排序 挖坑讲解方法
    [算法天天练]选择排序法
  • 原文地址：https://www.cnblogs.com/Sunshine-tcf/p/5774201.html
Copyright © 2011-2022 走看看