Pagini recente » Cod sursa (job #821442) | Cod sursa (job #1270459) | Cod sursa (job #135814) | Cod sursa (job #1158145) | Cod sursa (job #3314349)
#include <fstream>
#include <climits>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n, v[10001], SumMax = INT_MIN, st, dr;
int main()
{
cin >> n;
for(int i = 1; i <= n; i++)
cin >> v[i];
st = n, dr = -1;
for(int i = 1; i <= n; i++){
for(int j = i + 1; j <= n; j++){
int s = 0;
for(int k = i; k <= j; k++){
s += v[k];
if(s > SumMax)
SumMax = s, st = i, dr = k;
else if(s == SumMax){
if(k < st)
st = i, dr = k;
else if(st == i)
if(k - i + 1 < dr - st + 1)
st = i, dr = k;
}
}
}
}
cout << SumMax << " " << st << " " << dr;
return 0;
}