Cod sursa(job #2956798)
Utilizator | Data | 20 decembrie 2022 17:29:43 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
int v[6000001];
int n, s, b, sfa;
int inc = 1;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(int i = 1; i<=n; i++)
{
f>>v[i];
}
for(int i = 1; i<=n; i++)
{
if(s < 0)
{
s = v[i];
inc = i;
}
else
{
s += v[i];
}
if(s > b)
{
b = s;
sfa = i;
}
}
g<<b<<" "<<inc<<" "<<sfa;
return 0;
}