zoukankan      html  css  js  c++  java
  • ZJUT OJ 1007

    Jumping Cows 
    Time Limit:1000MS  Memory Limit:32768K

    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

    Source:

    USACO 2003 U S Open Orange
     
    code:
     1 /*
     2 贪心算法。注意边际条件。 
     3 */
     4 #include <iostream>
     5 #include <vector>
     6 using namespace std;
     7 
     8 int main()
     9 {
    10     for (int n; cin >> n;) {
    11         int strength = 0,
    12             count = 1;
    13         vector<int> ve;
    14         for (int i = 0; i < n; i++) {
    15             int p;
    16             cin >> p;
    17             ve.push_back(p);
    18         }
    19         for (int j = 0; j < ve.size() - 1; j++) {
    20             if (count % 2 == 0 && ve[j] < ve[j + 1]) {
    21                 strength -= ve[j];
    22                 count++;
    23             }                
    24             if (count % 2 != 0 && ve[j] > ve[j + 1]) {
    25                 strength += ve[j];
    26                 count++;
    27             }    
    28         }
    29         if (count % 2 != 0) strength += ve[ve.size() - 1];
    30         cout << strength << endl;
    31     }
    32 }
  • 相关阅读:
    Linux如何对文件内容中的关键字进行查找
    Gitlab如何进行备份恢复与迁移?
    Centos7上传文件和下载文件命令
    Linux下如何查看系统启动时间和运行时间
    您应该知道的35个绝对重要的Linux命令
    rabbitMq可靠消息投递之交换机备份
    rabbitMq可靠性投递之配置(消息至交换机,至队列不通的回调)
    springcloud超时重试机制的先后顺序
    mysql 8.0 1405的坑
    linux安装mysql8.0
  • 原文地址:https://www.cnblogs.com/findingsea/p/2677736.html
Copyright © 2011-2022 走看看