Cod sursa(job #1991036)
| Utilizator | Data | 14 iunie 2017 18:59:03 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define in "ssm.in"
#define out "ssm.out"
#define N 6000003
ifstream f(in);
ofstream g(out);
int a, n, i, smin=0, smax=0, s=0, imin=1, st, dr;
int main ()
{
f>>n;
for(i=1; i<=n; i++)
{
f>>a;
s+=a;
if(s-smin>smax)
{
smax=s-smin;
st=imin+1;
dr=i;
}
if(s<smin)
{
smin=s;
imin=i;
}
}
g<<smin<<' '<<st<<' '<<dr<<'\n';
f.close();
g.close();
return 0;
}
