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