Cod sursa(job #1743577)
Utilizator | Data | 18 august 2016 13:48:29 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,v[6666666],S,beg,enD,poz;
int main()
{
for(i=1,f>>n;i<=n;++i)f>>v[i];
int bst=-int(2e9);
for(i=0;i<n;++i)
{
if(S<0)S=v[i],poz=i;
else S+=v[i];
if(S>bst) bst=S,beg=poz,enD=i;
}
g<<bst<<' '<<beg<<' '<<enD;
return 0;
}