Cod sursa(job #1494867)
Utilizator | Data | 1 octombrie 2015 22:24:18 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | pregatire_cl.10_cnpr | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[6000005],n;
int main()
{
int i,Max,w,p,q,s;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
Max=v[1];
s=v[1];
w=1;
p=1;
q=1;
for(i=2; i<=n; i++)
{
s=s+v[i];
if(s>Max)
{
Max=s;
w=p;
q=i;
}
if(s<0)
{
p=i+1;
s=0;
}
}
g<<Max<<" "<<w<<" "<<q;
return 0;
}