zoukankan      html  css  js  c++  java
  • 杭电ACM 1003 ( 动态规划法 水题)

    #include <iostream>
    using namespace std;
    void MaxSum(int *p,long N);
    int main()
    {
        int T = 0;
        long N = 0;
        int CaseNum = 1;
        cin >> T;
        while(T--)
        {
            cin >> N;
    
            int *p = new int [N];
    
            for(int i = 0;i < N;i++)
    
                cin >> *(p + i);
    
            
            cout << "Case " << CaseNum <<":"<<endl;
    
            MaxSum(p,N);
    
            // 注意最后一行不换行
            if(T)
                cout << endl; 
            CaseNum ++;
            //内存管理
            delete p;
            p = 0;
            
    
        }
        return 0;
    }
    void MaxSum(int *p,long N)
    {
        long maxsum = -1001;
        long tempsum = 0;
        long index_begin = 0;
        long index_end = 0;
    
        for(long i = 0;i < N;i++)
        {
            tempsum = * (p + i);
    
            if(tempsum > maxsum)
            {
                maxsum = tempsum;
                index_begin = index_end = i;
            }
    
            for(long j = i + 1; j < N;j++)
            {
                if(tempsum + * (p + j) < 0)
                    break;
                else
                {
                    tempsum += * (p + j);
                    if(tempsum > maxsum)
                    {
                        maxsum = tempsum;
                        index_begin = i;
                        index_end = j;
                    }
                }
                    
            }
    
        }
    
        cout << maxsum << " " << index_begin + 1 << " " << index_end + 1<<endl;
    }
  • 相关阅读:
    pickle模块的基本使用
    python selenium 开发环境配置
    ubuntu ftp服务器搭建
    再探VIM配置
    counting elements--codility
    Time complexity--codility
    Arrays--codility
    Iterations --codility
    adobe reader DC 字体设置
    按位操作
  • 原文地址:https://www.cnblogs.com/StudipBird/p/3366136.html
Copyright © 2011-2022 走看看