Cod sursa(job #2171919)
| Utilizator | Data | 15 martie 2018 14:10:30 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
std::ifstream in("ssm.in");
std::ofstream out("ssm.out");
using namespace std;
int N,S;
int main()
{
int best = - (1 << 30);
int beg,endd,idx,sum = 0;
in >> N;
for ( int i = 1; i <= N ; ++i)
{
in >> S;
if( sum < 0)
sum = S , idx = i;
else
sum += S;
if(best < sum)
best = sum , beg = idx , endd = i;
}
out << best << " " << beg <<" " << endd;
}
