Cod sursa(job #2777943)
Utilizator | Data | 26 septembrie 2021 15:28:14 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n,x,i,j,st,dr,s[6000001],k,m;
int main()
{
k=-2147483647;
fin >>n;
for (i=1;i<=n;i++)
{fin >>x;
s[i]=s[i-1]+x;
if (k<s[i]-m) {k=s[i]-m;dr=i;st=j+1;}
if (m>s[i]) {m=s[i];j=i;}}
fout <<k<<' '<<st<<' '<<dr;
return 0;
}