Cod sursa(job #1636503)
| Utilizator | Data | 7 martie 2016 10:26:27 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int a[6000001],n,suma,st,fn,maxim;
int main()
{
int i,j;
f>>n;
for (i=1;i<=n;i++)
f>>a[i];
suma=0;
for (i=1;i<=n;i++)
{
if (suma<0)
{
suma=a[i];
st=i;
}
else suma+=a[i];
if (suma>maxim)
{
maxim=suma;
fn=i;
}
}
g<<maxim<<" "<<st<<" "<<fn;
return 0;
}
