Cod sursa(job #1905238)
Utilizator | Data | 5 martie 2017 23:03:49 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#define INF 2147483647
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int n, sum, inc, x, Min, Max = -INF, s, d;
int main()
{
f>>n;
inc = 0;
for (int i = 1; i <= n; i++)
{
f>>x;
sum += x;
if (sum - Min > Max) d = i, s = inc, Max = sum - Min;
if (sum < Min) Min = sum, inc = i;
}
g<<Max<<' '<< s + 1<<' '<<d;
return 0;
}