Cod sursa(job #2342193)
| Utilizator | Data | 12 februarie 2019 17:35:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
long long n/*, k*/, curIc = 1, sf = 1, x, ic = 1, s = 0, smax = -9223372036854775808;
in>>n/*>>k*/;
for(int i = 1; i<=n; i++)
{
in>>x;
if(s<0)
{
s = 0;
curIc = i;
}
s+=x;
if(s>smax/* && i-curIc+1>=k*/)
{
smax = s;
sf = i;
ic = curIc;
}
}
out<<smax<<" "<<ic<<" "<<sf;
return 0;
}
