Cod sursa(job #1107950)
| Utilizator | Data | 15 februarie 2014 10:08:29 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <cstdio>
using namespace std;
int v[1000];
int n, i, j, k;
int sum, S, st, dr;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf ("%d", &n);
for(i=1; i<=n; i++)
scanf("%d",&v[i]);
for(i=1; i<=n; i++)
{
for(j=n; j>=1; j--)
{
sum=0;
for(k=i; k<=j; k++)
sum+=v[k];
if(sum>S)
{
S=sum;
st=i;
dr=j;
}
}
}
printf("%d %d %d",S,st,dr);
}
