zoukankan      html  css  js  c++  java
  • cf 455A

    A. Boredom
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Alex doesn't like boredom. That's why whenever he gets bored, he comes up with games. One long winter evening he came up with a game and decided to play it.

    Given a sequence a consisting of n integers. The player can make several steps. In a single step he can choose an element of the sequence (let's denote it ak) and delete it, at that all elements equal to ak + 1and ak - 1 also must be deleted from the sequence. That step brings ak points to the player.

    Alex is a perfectionist, so he decided to get as many points as possible. Help him.

    Input

    The first line contains integer n (1 ≤ n ≤ 105) that shows how many numbers are in Alex's sequence.

    The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 105).

    Output

    Print a single integer — the maximum number of points that Alex can earn.

    Sample test(s)
    input
    2
    1 2
    output
    2
    input
    3
    1 2 3
    output
    4
    input
    9
    1 2 1 3 2 2 2 2 3
    output
    10
    Note

    Consider the third test example. At first step we need to choose any element equal to 2. After that step our sequence looks like this [2, 2, 2, 2]. Then we do 4 steps, on each step we choose any element equals to 2. In total we earn 10 points.

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<string>
    #include<cmath>
    #include<cstdlib>
    #include<algorithm>
    using namespace std;
    #define LL long long
    LL n,dp[100010],tt;
    int main()
    {
          scanf("%I64d",&n);
          for(LL i=1;i<=n;i++)
          {
               scanf("%I64d",&tt);
               dp[tt]++;
          }
          for(LL i=2;i<=100000;i++)
                dp[i]=max(dp[i-1],dp[i-2]+dp[i]*i);
          printf("%I64d
    ",dp[100000]);
          return 0;
    }
    

      

  • 相关阅读:
    用Processon在线绘制UML的尝试
    软工UML学习札记
    结对项目:计算器 第三篇
    结对项目:计算器 第二篇
    TXT四则运算计算器 后日谈
    TXT四则运算计算器
    软件工程作业 四则运算(一)
    敏捷开发
    如何做“足够好”的软件
    关于如何衡量个人在各自团队的效率和绩效
  • 原文地址:https://www.cnblogs.com/a972290869/p/4240460.html
Copyright © 2011-2022 走看看