【练习09】简单动态规划 1001 最大连续子序列

//模板开始#include <string>   #include <vector>   #include <algorithm>   #include <iostream>   #include <sstream>   #include <fstream>   #include <map>   #include <set>   #include <cstdio>   #include <cmath>   #include <cstdlib>   #include <ctime>#include<iomanip>#define SZ(x) (int(x.size()))using namespace std;int toInt(string s){istringstream sin(s); int t; sin>>t; return t;}template<class T> string toString(T x){ostringstream sout; sout<<x; return sout.str();}typedef long long int64;int64 toInt64(string s){istringstream sin(s); int64 t; sin>>t;return t;}template<class T> T gcd(T a, T b){ if(a<0) return gcd(-a, b);if(b<0) return gcd(a, -b);return (b == 0)? a : gcd(b, a % b);}//模板结束（通用部分）//【练习09】简单动态规划 1001 最大连续子序列int calculate_add_max(int* datas, int* add_max, int j){return add_max[j + 1]>0?datas[j]+add_max[j + 1]:datas[j];}int main(){ifstream ifs("shuju.txt", ios::in);int k;int datas[10005];int add_max[10005];//while(ifs>>k && k != 0)while(cin>>k && k != 0){if(k == 1){int temp;//ifs>>temp;cin>>temp;if(temp < 0){cout<<0<<" "<<temp<<" "<<temp<<endl;continue;}else{cout<<temp<<" "<<temp<<" "<<temp<<endl;continue;}}for(int i = 0; i < k; i++){//ifs>>datas[i];cin>>datas[i];}add_max[k - 1] = datas[k - 1];for(int j = k - 2; j >= 0; j--){add_max[j] = calculate_add_max(datas, add_max, j);}int the_max = add_max[0];int the_index = 0;for(int j = 1; j < k; j++){if(add_max[j] > the_max){the_max = add_max[j];the_index = j;}}if(the_max < 0){cout<<0<<" "<<datas[0]<<" "<<datas[k - 1]<<endl;continue;}for(int j = the_index + 1; j < k; j++){if(add_max[j] <= 0){cout<<add_max[the_index]<<" "<<datas[the_index]<<" "<<datas[j - 1]<<endl;break;}}}return 0;}