Cod sursa(job #1800034)
Utilizator | Data | 7 noiembrie 2016 11:06:41 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
int a[6000001];
int main()
{
int n,j,x,y,i; int m,s;
ifstream f("ssm.in"); ofstream g("ssm.out");
f>n;
for(i=1;i<=n;i++) {f>>a[i];}
i=1;
m=0;
s=0;
i=1;
j=1;
while(i<=n)
{
s=s+a[i];
if (s>m) {m=s;x=j;y=i;}
if (s<0) {s=0;j=i+1;}
i++;
}
g<<m<<" "<<x<<" "<<y;
return 0;
}