Cod sursa(job #2378405)
| Utilizator | Data | 12 martie 2019 10:40:07 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
typedef long long ll;
int main()
{
ll S,n,i,max1=0,x,st,stop,start,fn;
fin>>n;
S=0;
st=1;
fn=0;
for(i=1;i<=n;++i)
{
fin>>x;
fn++;
S+=x;
if(S>max1) {max1=S,start=st,stop=fn;}
if(S<0) {S=0,st=fn+1,fn=fn;}
}
fout<<max1<<" "<<start<< " "<<stop<<"\n";
return 0;
}
