Cod sursa(job #1371836)
| Utilizator | Data | 4 martie 2015 09:17:37 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <iomanip>
using namespace std;
ofstream out("ssm.out");
int a[6000000];
int n,bestSum,i;
bool ok=false;
int x,sum;
int main()
{
freopen("ssm.in","r",stdin);
scanf("%d",&n);
for(i=1; i<=n; i++)
scanf("%d",&a[i]);
sum = 0;
bestSum = -9999;
x=1;
int y=n;
for (i = 1; i <= n; i++)
{
sum += a[i];
if (sum < 0)
sum = 0,x=i;
else if (sum > bestSum)
bestSum = sum ,y=i;
}
out<<bestSum<<" "<<x+1<<" "<<y;
return 0;
}
