Cod sursa(job #3228933)
| Utilizator | Data | 12 mai 2024 13:48:02 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int N, p, u, x,
sCrt = 0, pCrt = 1,
sMax = -2000000000;
int main()
{
f >> N;
for(int i = 1; i <= N; i++)
{
f >> x;
if(sCrt >= 0)
sCrt += x;
else
{
sCrt = x;
pCrt = i;
}
if(sMax < sCrt)
{
sMax = sCrt;
p = pCrt;
u = i;
}
}
g << sMax << ' ' << p << ' ' << u;
f.close();
g.close();
return 0;
}
