Pagini recente » Cod sursa (job #2230143) | Solutii preONI 2006 - Runda 1 | Cod sursa (job #1514175) | Cod sursa (job #2029976) | Cod sursa (job #1130540)
#include <iostream>
#include <fstream>
#define N_MAX 6000010
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n, s[N_MAX], sum[N_MAX], best[N_MAX], best_sum, imin, imax;
int main()
{
in >> n;
for(int i = 1; i <= n; i++)
{
in >> s[i];
sum[i] = sum[i - 1] + s[i];
}
int smin = sum[0];
for(int i = 2; i <= n; i++)
{
best[i] = sum[i] - smin;
if(smin > sum[i]){ smin = sum[i]; imin = i + 1; }
if(best[best_sum] < best[i]){ best_sum = i; imax = i; }
}
out << best[best_sum] << " " << imin << " " << imax;
return 0;
}