Cod sursa(job #864608)
| Utilizator | Data | 25 ianuarie 2013 14:30:02 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#define inf 0x3f3f3f3f
using namespace std;
int i,n,S,sum,bestSum,idx,end1,beg;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
f>>n;sum=0;bestSum=-inf;
for(i=1;i<=n;i++)
{
f>>S;
if (sum < 0)
sum = S, idx = i;
else
sum += S;
if (sum > bestSum)
bestSum = sum, beg = idx, end1 = i;
}
g<<bestSum<<" "<<beg<<" "<<end1;
return 0;
}
