Cod sursa(job #1515702)
| Utilizator | Data | 2 noiembrie 2015 08:38:27 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <cstdio>
using namespace std;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int x;
int n;
int max=999999999,p,q;
int sum = -(1 << 29);
int begg;
scanf("%d",&n);
for (int i = 1;i <= n;++i)
{
scanf("%d",&x);
if (sum < 0)
sum = x,begg = i;
else sum += x;
if (sum > max)
{
max = sum;
p = begg;
q = i;
}
}
printf("%d %d %d",max,p,q);
return 0;
}
