Cod sursa(job #1249830)
Utilizator | Data | 27 octombrie 2014 15:48:39 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int N,i;
f>>N;
int s=0,best=0,x;
int si=0,besti=0,bestj;
for(i=1;i<=N;i++)
{
f>>x;
if(s<0 || i==1) {s=x; si=i;}
else s+=x;
if(s>best || i==1) {best=s; besti=si; bestj=i; }
}
g<<best<<' '<<besti<<' '<<bestj;
}