1007 Maximum Subsequence Sum

#include<iostream>
using namespace std;

int nums[10001];

int main() {
	int K;
	cin >> K;
	int imax = -1;
	int minnum = 0 , maxnum = K - 1;
	for (int i = 0; i < K; i++) {
		cin >> nums[i];
	}
	//dp[0] = nums[0];
	int temp = 0;
	int tempnum = 0;
	for (int i = 0; i < K; i++) {
		temp += nums[i];
		if (temp < 0) {
			temp = 0;
			tempnum = i + 1;
		}
		else if(temp > imax){
			imax = temp;
			minnum = tempnum;
			maxnum = i;
		}
 	}					
	if (imax < 0) {
		maxnum = K - 1;
		minnum = 0;
		imax = 0;
	}
	cout << imax << " ";
	cout << nums[minnum] << " " << nums[maxnum];
	return 0; 
}