Cod sursa(job #2087820)
Utilizator | Data | 14 decembrie 2017 12:31:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int n, me, mv, m = ~0;
int *a;
int main()
{
ifstream f("ssm.in");
f>>n;
a = new int[n+1];
a[0] = 0;
for (int i=1;i<=n;i++)
{
f>>a[i];
if (a[i-1]<a[me])
me = i-1;
a[i]+=a[i-1];
if (a[i]-a[me]>m)
m = a[i]-a[me], mv = i;
}
ofstream g("ssm.out");
g<<m<<' '<<me+1<<' '<<mv;
}