Cod sursa(job #1679215)
| Utilizator | Data | 7 aprilie 2016 19:16:23 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
FILE *f,*g;
int a[6000002];
int main()
{
int n,k,i,l,q,w,b,j,r,d,s;
f=fopen("ssm.in","r");
g=fopen("ssm.out","w");
fscanf(f,"%d",&n);
a[0]=0;
for(i=1;i<=n;i++)
{
fscanf(f,"%d ",&a[i]);
}
b=-100001;
for(j=1;j<=n;j++)
{
s=a[j];
for(i=j+1;i<=n;i++)
{
s=s+a[i];
if(s>b)
{
b=s;
q=i;
w=j;
}
}
}
fprintf(g,"%d %d %d",b,w,q);
return 0;
}
