zoukankan      html  css  js  c++  java
  • poj 2181

    E - Jumping Cows
    Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

    Description

    Farmer John's cows would like to jump over the moon, just like the cows in their favorite nursery rhyme. Unfortunately, cows can not jump. 

    The local witch doctor has mixed up P (1 <= P <= 150,000) potions to aid the cows in their quest to jump. These potions must be administered exactly in the order they were created, though some may be skipped. 

    Each potion has a 'strength' (1 <= strength <= 500) that enhances the cows' jumping ability. Taking a potion during an odd time step increases the cows' jump; taking a potion during an even time step decreases the jump. Before taking any potions the cows' jumping ability is, of course, 0. 

    No potion can be taken twice, and once the cow has begun taking potions, one potion must be taken during each time step, starting at time 1. One or more potions may be skipped in each turn. 

    Determine which potions to take to get the highest jump.

    Input

    * Line 1: A single integer, P 

    * Lines 2..P+1: Each line contains a single integer that is the strength of a potion. Line 2 gives the strength of the first potion; line 3 gives the strength of the second potion; and so on. 

    Output

    * Line 1: A single integer that is the maximum possible jump. 

    Sample Input

    8
    7
    2
    1
    8
    4
    3
    5
    6
    

    Sample Output

    17
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<string>
    #include<cmath>
    #include<cstdlib>
    #include<algorithm>
    using namespace std;
    int p,a[150010];
    int main()
    {
          while(scanf("%d",&p)!=EOF)
          {
                int sum=0;
                for(int i=1;i<=p;i++)
                      scanf("%d",&a[i]);
                bool flag=0;
                for(int i=1;i<=p;i++)
                {
                      if(a[i]>=a[i-1]&&a[i]>=a[i+1]&&!flag)
                      {
                            sum+=a[i];
                            flag=1;
                      }
                      if(a[i]<=a[i-1]&&a[i]<=a[i+1]&&flag)
                      {
                            sum-=a[i];
                            flag=0;
                      }
                }
                printf("%d
    ",sum);
          }
          return 0;
    }
    

      

  • 相关阅读:
    MySQL常用命令记录
    VM新安装centos7无法连接网络的问题
    nginx + tomcat实现负载均衡
    Redis集群分布(Windows版)
    7.2 基础知识ArrayMap
    7.1 基础知识Android消息处理机制
    6.5 Android硬件访问服务使用反射
    6.4 Android硬件访问服务编写HAL代码
    6.3 Android硬件访问服务APP代码
    6.2、Android硬件访问服务编写系统代码
  • 原文地址:https://www.cnblogs.com/a972290869/p/4252181.html
Copyright © 2011-2022 走看看