Cod sursa(job #1936226)
Utilizator | Data | 22 martie 2017 22:21:25 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
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,poz,K,inc,fin,maxx,dr,x,s[6000001];
long long S;
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
f>>x;
if (S < 0)
{
S = x;
K = i;
}
if(S > 0 )
S = S + x;
if (maxx < S)
{
maxx = S;
inc=K;
fin = i;
}
}
g<<maxx<<" ";
g<<inc<<" "<<fin;
return 0;
}