Cod sursa(job #1498748)
Utilizator | Data | 9 octombrie 2015 00:31:54 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int d,i1,j1,x,maxx=-(1<<31),n,poz;
f>>n;
d=0;i1=0;j1=0;
for(int i=1;i<=n;i++)
{
f>>x;
if(d>=0) d+=x;
else {d=x;poz=i;}
if(d>maxx) {maxx=d;i1=poz;j1=i;}
}
g<<maxx<<" "<<i1<<" "<<j1;
return 0;
}