Cod sursa(job #2168276)
Utilizator | Data | 14 martie 2018 10:14:47 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,nr,in,sf,ind=1,sum,sMax,p1,p2;
int main()
{
f>>n;
for(int i=1;i<=n;++i)
{
f>>nr;
if(sum<0)sum=nr,in=i;
else sum+=nr;
if(sum>sMax)
{
sMax=sum;
p1=in;p2=i;
}
}
g<<sMax<<" "<<p1<<" "<<p2<<'\n';
return 0;
}