Cod sursa(job #1100509)
| Utilizator | Data | 6 februarie 2014 22:16:27 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include<cstdio>
using namespace std;
#define oo (1<<30)
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int N;
int start,finish,Sum,bestSum,idx;
scanf("%d",&N);
bestSum = Sum = - oo;
for(int i=1,a;i<=N;i++)
{
scanf("%d",&a);
if(Sum<0)
{
Sum=a;
idx=i;
}
else
Sum += a;
if(bestSum < Sum)
{
bestSum = Sum;
start = idx;
finish = i;
}
}
printf("%d %d %d\n",bestSum,start,finish);
return 0;
}
