PAT 1007. Maximum Subsequence Sum (25)

#include<iostream>
using namespace std;
int k;
int arr[10005];
int sum = 0, MAX;
int start = 0, dest = 0;
int main(){
cin >> k;
for (int i = 0; i < k; i++)
cin >> arr[i];
MAX = arr[0];
for (int i = 0; i < k; i++){
sum = 0;
for (int j = i; j < k; j++){
sum += arr[j];
if (sum>MAX){
MAX = sum;
start = i;
dest = j;
}
}
}
if (MAX < 0){
cout << "0" << " " << arr[0] << " " << arr[k - 1];
}
else
cout << MAX << " " << arr[start] << " " << arr[dest];
}