Cod sursa(job #2176477)
Utilizator | Data | 17 martie 2018 15:22:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,s[6000010],sum,bestsum=-(2e9),ind=1,pr,ul;
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{
in>>s[i];
if(sum<0) sum=s[i],ind=i;
else sum+=s[i];
if(bestsum<sum)bestsum=sum,pr=ind,ul=i;
}
out<<bestsum<<' '<<pr<<' '<<ul;
}