zoukankan      html  css  js  c++  java
  • codeforces 484D D. Kindergarten(dp)

    题目链接:

    D. Kindergarten

    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    In a kindergarten, the children are being divided into groups. The teacher put the children in a line and associated each child with his or her integer charisma value. Each child should go to exactly one group. Each group should be a nonempty segment of consecutive children of a line. A group's sociability is the maximum difference of charisma of two children in the group (in particular, if the group consists of one child, its sociability equals a zero).

    The teacher wants to divide the children into some number of groups in such way that the total sociability of the groups is maximum. Help him find this value.

    Input

    The first line contains integer n — the number of children in the line (1 ≤ n ≤ 106).

    The second line contains n integers ai — the charisma of the i-th child ( - 109 ≤ ai ≤ 109).

    Output

    Print the maximum possible total sociability of all groups.

    Examples
    input
    5
    1 2 3 1 2
    output
    3
    input
    3
    3 3 3
    output
    0

    题意:

    把n个数分成一段一段的,每段的值为这段的最大值与最小值之差,现在要分段使值得和最大,最大是多少;

    思路:

    不会做,看别人说要dp,然后瞎搞了一个dp,然后就过了;
    哈哈,真是搞不懂自己怎么写的,反正就是一个上升段的在一起,一个下降段在一起,对于转折点就判断一下把它分到哪个段才能使值得和最大,然后就哈哈哈了;

    AC代码:

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <cmath>
    #include <bits/stdc++.h>
    #include <stack>
    #include <map>
      
    using namespace std;
      
    #define For(i,j,n) for(int i=j;i<=n;i++)
    #define mst(ss,b) memset(ss,b,sizeof(ss));
      
    typedef  long long LL;
      
    template<class T> void read(T&num) {
        char CH; bool F=false;
        for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar());
        for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar());
        F && (num=-num);
    }
    int stk[70], tp;
    template<class T> inline void print(T p) {
        if(!p) { puts("0"); return; }
        while(p) stk[++ tp] = p%10, p/=10;
        while(tp) putchar(stk[tp--] + '0');
        putchar('
    ');
    }
      
    const LL mod=1e9+7;
    const double PI=acos(-1.0);
    const int inf=1e9;
    const int N=1e6+20;
    const int maxn=1e6+220;
    const double eps=1e-12;
     
    int n,a[N];
    LL dp[N][2];
    
    int main()
    {
        read(n);
        For(i,1,n)read(a[i]);
        dp[0][0]=dp[0][1]=0;
        dp[1][0]=dp[1][1]=0;
        for(int i=2;i<=n;i++)
        {
            if(a[i]>a[i-1])
            {
                dp[i][1]=max(dp[i][1],dp[i-1][1]+a[i]-a[i-1]);
                dp[i][1]=max(dp[i][1],dp[i-2][0]+a[i]-a[i-1]);
            }
            else 
            {
                dp[i][0]=max(dp[i][0],dp[i-1][0]+a[i-1]-a[i]);
                dp[i][0]=max(dp[i][0],dp[i-2][1]+a[i-1]-a[i]);
            }
            dp[i][0]=max(dp[i][0],dp[i-1][0]);
            dp[i][1]=max(dp[i][1],dp[i-1][1]);
           // cout<<i<<" "<<dp[i][0]<<" "<<dp[i][1]<<endl;
        }
        cout<<max(dp[n][0],dp[n][1])<<endl;
    
        return 0;
    }
    

      

  • 相关阅读:
    「初级篇」跟我一起学docker(二)--核心概念和安装
    程序员有哪些借口可以让自己写出低质量的代码?
    「初级篇」跟我一起学docker(一)--认识
    后端程序猿怎么提高技术?提高编码质量?
    河南这么大的省,也所谓的准一线,为什么IT行业就是发展不起来呢?
    JAVA使用Gson解析json数据,实例
    JAVA equals 和 “==”的异同
    JAVA WEB 对返回数据进行按中文名称首字母A~Z升序排序
    JAVA验证数字的正则表达式,来一发
    【转】Java.util.ArrayList.set()方法实例
  • 原文地址:https://www.cnblogs.com/zhangchengc919/p/5838985.html
Copyright © 2011-2022 走看看