Pagini recente » Cod sursa (job #1805506) | Cod sursa (job #1933485) | Cod sursa (job #1733478) | Cod sursa (job #2650427) | Cod sursa (job #3125503)
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMAX = 6000000;
int v[NMAX+5];
long long dp[NMAX+5];
int main()
{
int n, left, right;
long long summax = INT_MIN;
fin>>n;
for (int i = 1; i <= n; i++) fin>>v[i], dp[i] = dp[i-1]+v[i];
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j++)
if (dp[j]-dp[i-1] > summax) summax = dp[j]-dp[i-1], left = i, right = j;
fout<<summax<<' '<<left<<' '<<right;
return 0;
}