Pagini recente » Cod sursa (job #1346806) | Cod sursa (job #312001) | Cod sursa (job #3257071) | Cod sursa (job #2838551) | Cod sursa (job #3314350)
#include <fstream>
#include <climits>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n, nr, SP[100001], SumMax = INT_MIN, st, dr;
int main()
{
cin >> n;
for(int i = 1; i <= n; i++)
cin >> nr, SP[i] = SP[i - 1] + nr;
for(int i = 1; i <= n; i++)
for(int j = i + 1; j <= n; j++){
if(SP[j] - SP[i - 1] > SumMax){
SumMax = SP[j] - SP[i - 1], st = i, dr = j;
}
if(SP[j] - SP[i - 1] == SumMax)
if(i < st)
st = i, dr = j;
else if(i == st)
if(j - i + 1 < dr - st + 1)
st = i, dr = j;
}
cout << SumMax << " " << st << " " << dr;
return 0;
}