Cod sursa(job #1854453)
| Utilizator | Data | 22 ianuarie 2017 19:02:06 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#define MAX 6000000
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s,i,smax,a[MAX],n,poz1,poz2,pozi;
void sumamaxima(int n,int a[])
{for(i=1;i<=n;i++)
smax=a[i];
s=a[1];
pozi=1;
for(i=2;i<=n;i++)
{
s=s+a[i];
if(smax<s){smax=s;poz2=i;poz1=pozi;}
if(s<0){s=0;pozi=i+1;}
}
fout<<smax<<" "<<poz1<<" "<<poz2;
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
sumamaxima(n,a);
return 0;
}
