Cod sursa(job #504243)
Utilizator | Data | 27 noiembrie 2010 11:02:26 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <stdio.h>
#include <fstream>
using namespace std;
int n;
int main()
{
fstream fin("ssm.in");
//freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
fin>>n;
int a;
int max=-200000;
int s=0;
int j,k,k2;
for(int i=0;i<n;i++)
{
fin>>a;
s+=a;
if(s>max)
max=s,k=i,k2=j;
if(s<0)
s=0,j=i+1;
}
printf("%d %d %d",max,k2+1,k+1);
return 0;
}