Cod sursa(job #1876293)
Utilizator | Data | 12 februarie 2017 11:07:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
int main() {
ifstream f("smm.in");
ofstream g("smm.out");
int n, sum=0, a, i, smax=-(1<<31), st, dr, pozmin, minn;
f>>n;
for (i=1; i<=n; i++) {
f>>a; sum+=a;
if (sum-minn>smax) {
smax=sum-minn;
st=pozmin+1;
dr=i;
}
if (sum<minn)
minn=sum, pozmin=i;
}
g<<smax<<' '<<st<<' '<<dr;
f.close();
g.close();
}