Cod sursa(job #1362709)
| Utilizator | Data | 26 februarie 2015 14:44:08 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#define VM 6000001
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n;
f>>n;
int SumaCurenta=0,a,indice,inceput,sfarsit;
long long bestSum = -VM;
for(int i=1;i<=n;i++)
{
f>>a;
if(SumaCurenta+a<a)
{
indice=i;
SumaCurenta=a;
}
else
SumaCurenta+=a;
if(SumaCurenta>bestSum)
{
bestSum=SumaCurenta;
inceput=indice;
sfarsit=i;
}
}
g<<bestSum<<" "<<inceput<<" "<<sfarsit;
return 0;
}
