zoukankan      html  css  js  c++  java
  • UVALive 4764 简单dp水题(也可以暴力求解)

    B - Bing it
    Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

    Description

    Download as PDF

    I guess most of you played cards on the trip to Harbin, but I'm sure you have never played the following card game. This card game has N rounds and 100000 types of cards numbered from 1 to 100000. A new card will be opened when each round begins. You can ``bing" this new card. And if the card you last ``bing" is the same with this new one, you will get 1 point. You can "bing" only one card, but you can change it into a new one. For example, the order of the 4 cards is 1 3 4 3. You can ``bing" 1 in the first round and change it into 3 in the second round. You get no point in the third round, but get 1 point in the last round. Additionally, there is a special card 999. If you ``bing" it and it is opened again, you will get 3 point.

    Given the order of N cards, tell me the maximum points you can get.

    Input

    The input file will contain multiple test cases. Each test case will consist of two lines. The first line of each test case contains one integer N(2$ le$N$ le$100000). The second line of each test case contains a sequence of n integers, indicating the order of cards. A single line with the number ``0" marks the end of input; do not process this case.

    Output

    For each input test case, print the maximum points you can get.

    Sample Input

    2 
    1 1 
    5 
    1 999 3 3 999 
    0
    

    Sample Output

    1 
    3
    

    #include<stdio.h>
    #include<string.h>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    
    int dp[100010];
    bool vis[100010];
    int a[100010];
    
    int main(){
        int n;
    
        while(scanf("%d",&n)!=EOF){
                if(n==0)
                break; 
            
            
            memset(dp,0,sizeof(dp));
            memset(a,0,sizeof(a));
            memset(vis,false,sizeof(vis));
    
           for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
           }
           
             int sum=-1;
             
               int point=a[0];
               vis[point]=true;
               
               
               
             for(int i=1;i<n;i++){
                 int next=a[i];
                 if(!vis[next]){
                    
                    dp[next]=dp[point];
                    vis[next]=true;
                 }
                 else{
                     if(next==999){
                        dp[next]=max(dp[point],dp[next]+3);
                        }
                    else{
                       dp[next]=max(dp[point],dp[next]+1);
                       }
                 }
                 
                 point=next;
                 
                 if(dp[next]>sum)
                    sum=dp[next];
    
             }
             printf("%d
    ",sum);
        }
        return 0;
    }
  • 相关阅读:
    springMVC+freemarker中Could not resolve view with name... 问题解决
    mybatis中if test 语句 当参数类型为string时,如何写判断条件
    博科交换机升级FOS系统
    response.redirect 和Server.Transfer 的区别
    win7 安装MyGeneration版本,没有安装mdac的解决办法
    Zen Cart的sidebox机制
    ASPCMS相册 实现每张图片对应一段文字
    ZEN CART 系统想在首页调用 新闻插件 的 新闻列表的方法
    JS获得来源页
    zen cart去掉zenid的简单方法
  • 原文地址:https://www.cnblogs.com/13224ACMer/p/4700268.html
Copyright © 2011-2022 走看看