Pagini recente » Cod sursa (job #1531799) | Istoria paginii runda/tot_2 | Cod sursa (job #493845) | Cod sursa (job #1428864) | Cod sursa (job #1603818)
#include <fstream>
#include <cstdio>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout("ssm.out");
int sum[6000001];
int main()
{
int n, Min = 0, bestSum = -int(2e9), aux, pozMin, pozMax;
fin >> n;
for(int i = 1; i <= n; ++i) sum[i];
fin.close();
for(int i = 1; i <= n; ++i)
{
sum[i] += sum[i - 1];
if(bestSum < sum[i] - Min)
{
bestSum = sum[i] - Min;
pozMin = aux + 1;
pozMax = i;
}
if(Min > sum[i])
{
Min = sum[i];
aux = i;
}
}
fout << bestSum << " " << pozMin << " " << pozMax;
fout.close();
return 0;
}