Cod sursa(job #830075)
Utilizator | Muresan Ciprian mcip1977 | Data | 6 decembrie 2012 12:52:17 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,x,s[6000001],maxx=-6000000,im,jm;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
s[i]=x;
if(s[i]<s[i-1]+x) s[i]=s[i-1]+x;
if(s[i]>maxx)
{ maxx=s[i];
jm=i;
}
}
fout<<maxx<<" ";
im=jm;
while(im>0 && s[im]>=0) im--;
im++;
fout<<im<<" "<<jm;
return 0;
}