Cod sursa(job #2167351)
| Utilizator | Data | 13 martie 2018 21:17:20 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
#define N 6000005
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n;
int a[N];
int main()
{ int i,s,smax; int p,u; int idx;
fin>>n;
for (i=1;i<=n;i++) fin>>a[i];
s=a[1]; smax=a[1];
if (s<0) s=0;
for (i=2;i<=n;i++)
{ s+=a[i];
if (s>smax) { smax=s; p=idx+1; u=i; }
if (s<0) { s=0; idx=i; }
}
fout<<smax<<" "<<p<<" "<<u;
return 0;
}
