Cod sursa(job #2180798)
| Utilizator | Data | 21 martie 2018 10:36:33 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n,S,sum=0,bestsum=-1000000000,beg,endi,ind;
f>>n;
for(int i=1;i<=n;i++)
{
f>>S;
sum=sum+S;
if(sum>bestsum)
{
bestsum=sum;
beg=ind; endi=i;
}
if(sum<0)
{
sum=0;
ind=i+1;
}
}
g<<bestsum<<" "<<beg<<" "<<endi;
return 0;
}
