Cod sursa(job #1781352)
| Utilizator | Data | 16 octombrie 2016 20:12:33 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a[7000002],s[7000002];
int n,i,MIN,j,pj,pi,MAX;
int main()
{fin>>n;
for(i=1;i<=n;i++)
{fin>>a[i];
s[i]=s[i-1]+a[i];
}
MIN=0;
MAX=s[1];
j=0;
for(i=1;i<=n;i++)
{
if(s[i]-MIN>MAX)
{MAX=s[i]-MIN;
pj=j;
pi=i;}
if(s[i]<MIN)
{MIN=s[i];
j=i;
}
}
fout<<MAX<<" "<<pj+1<<" "<<pi;
return 0;
}
