算法导论第4章习题与思考题（转）

 

Exercise 4.1-1

返回 中最大的一个负数。

Exercise 4.1-2

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<algorithm>
#include<xfunctional>
using namespace std;

int find_maxsum(vector<int>& elem){
    int res = INT_MIN;
    int sum = 0;
    for (int i = 0; i < elem.size(); i++){
        sum = elem[i];
        for (int j = i + 1; j < elem.size(); j++){
            sum += elem[j];
            if (sum > res) res = sum;
        }
    }
    return res;
}

int main(){
    int n;
    cout << "Input the amount of the element:";
    cin >> n;
    vector<int> elem(n,0);
    for (int i = 0; i < n; i++) cin >> elem[i];
    int res = find_maxsum(elem);
    cout << "The result: " << res << endl;
    system("pause");
    return 0;
}

View Code