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