zoukankan      html  css  js  c++  java
  • 第一周 01-复杂度2 Maximum Subsequence Sum

    Given a sequence of K integers { N​1​​, N​2​​, ..., N​K​​ }. A continuous subsequence is defined to be { N​i​​, N​i+1​​, ..., N​j​​ } where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.

    Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.

    Input Specification:

    Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (≤10000). The second line contains K numbers, separated by a space.

    Output Specification:

    For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.

    Sample Input:
    10
    -10 1 2 3 4 -5 -23 3 7 -21
    
    Sample Output:
    10 1 4
    
    两种解法,看着解:
    1AC
    #include <iostream>
    using namespace std;
    int main(){
        int n,now,max,maxstart,maxend;
        int sum,sumstart,first;
        while(cin>>n&&n){
            cin>>now;
            max=maxstart=maxend=now;
            sum=sumstart=first=now;
            for(int j=2;j<=n;j++){
                cin>>now;
                if(sum<0) sum=sumstart=now;
                else sum+=now;
                if(sum>max) max=sum,maxstart=sumstart,maxend=now;    
            }
            if(max<0) cout<<"0"<<" "<<first<<" "<<now<<endl;
            else cout<<max<<" "<<maxstart<<" "<<maxend<<endl;
        }
        return 0;
    }

    2AC(在PTA提交会TLE,在HDU上提交AC)

    #include<bits/stdc++.h>
    using namespace std;
    int a[10010];
    int dp[10010];
    int main()
    {
        int k;
        while(scanf("%d",&k)&&k)
        {
            int ma=-1,s1=0,e1=0,s2,e2,j=0;
            memset(dp,0,sizeof(dp));
            memset(a,0,sizeof(a));
            for(int i=1;i<=k;i++)
            {
            scanf("%d",&a[i]);    
            if(a[i]<0)
            j++;
            dp[i]=max(dp[i-1]+a[i],a[i]);
            if(dp[i]==a[i])
            {
                s1=i;
                e1=i;
            }
            else
            {
                e1=i;
            }
            if(dp[i]>ma)
            {
                ma=dp[i];
                s2=s1;
                e2=e1;
            }
            }
            if(j==k)
            printf("0 %d %d
    ",a[1],a[k]);
            else
            printf("%d %d %d
    ",ma,a[s2],a[e2]);
        }
        return 0;
    }
    天晴了,起飞吧
  • 相关阅读:
    Eclipse安装TestNG插件
    总结Selenium WebDriver中一些鼠标和键盘事件的使用
    【资料收集】AutomationGuru
    centos7.4 yum安装包出现网络不可达跟Recv failure: Connection reset by peer" 这个问题
    ubuntu配置ntp
    OpenStack-ansible ubuntu16.04安装&& centos7 安装 && openSUSE 安装OpenStack-ansible
    HSRP&&STP&&ACL
    vlan通讯&&动态路由
    cisco交换机基本配置
    cisco教程 怎么改console密码 主机名 各种模式的切换等
  • 原文地址:https://www.cnblogs.com/jianqiao123/p/11456612.html
Copyright © 2011-2022 走看看