Cod sursa(job #2035462)
Utilizator | Data | 9 octombrie 2017 14:16:13 | |
---|---|---|---|
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 n,v[6000005];
int main()
{
int inc,sf,maxim=0,r;
f>>n;
for(int i = 1;i <= n; i++)
f >> v[i];
int s=0;
for(int i=1; i<=n;i++)
{
s+=v[i];
if(s<0)
{
s=0;
inc=i+1;
}
if(s>maxim)
{
maxim=s;
r=inc;
sf=i;
}
}
g<<maxim<<" "<<r<<" "<<sf;
return 0;
}