Cod sursa(job #2409683)
Utilizator | Data | 19 aprilie 2019 12:40:10 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,a,i,smin,pn,smax=-1000000,px,s,poz;
int main()
{
in>>n;
smin=0;
pn=0;
for(i=1;i<=n;i++)
{
in>>a;
s=s+a;
if(s-smin>smax)
{
smax=s-smin;
px=i;
poz=pn+1;
}
if(smin>s)
{
smin=s;
pn=i;
}
}
out<<smax<<" "<<poz<<" "<<px;
return 0;
}