Cod sursa(job #2124283)
Utilizator | Data | 7 februarie 2018 08:19:55 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int mn,mx,x,s,k,st,i,dr,n;
int main()
{
f>>n;
f>>x;
mn=mx=x;
st=dr=1;
s=x;
k=1;
for(i=2;i<=n;i++)
{
f>>x;
s=s+x;
if(s-mn>mx)
{
mx=s-mn;
dr=i;
st=k+1;
}
else if(s<mn)
{
mn=s;
k=i;
}
}
g<<mx<<" "<<st<<" "<<dr;
return 0;
}