Cod sursa(job #1936215)
Utilizator | Data | 22 martie 2017 22:13:04 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int minim,maxim,i,st,k,n,dr,x,s[6000001];
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
s[i]=s[i-1]+x;
}
for(i=1;i<=n;i++)
{
if(s[i]-minim>maxim)
{
maxim=s[i]-minim;
st=i;
dr=k;
}
if(s[i]<minim)
{
minim=s[i];
k=i+1;
}
}
g<<maxim<<" ";
g<<dr<<" "<<st;
return 0;
}