Cod sursa(job #3282553)
Utilizator | Data | 5 martie 2025 22:11:57 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n, s, d, sum, smax, i, a[6000001], b, c;
int main()
{
fin >> n;
for (i=1; i<=n; i++)
fin >> a[i];
s=1;
d=1;
while (d<=n)
{
sum=sum+a[d++];
if (sum>smax) {smax=sum; c=s; b=d-1;}
else if (sum<0) {s=d; sum=0;}
}
fout << smax << " " << c << " " << b;
return 0;
}