Cod sursa(job #1392051)
Utilizator | Data | 18 martie 2015 12:44:16 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long long n, i, x, p=1, u=1, s, smax, p2;
int main()
{
fin>>n;
smax=-2000000000;
for(i=1; i<=n; i++)
{
fin>>x;
s+=x;
if(s>smax)
{
smax=s;p=p2;
u=i;
}
if(s<0)
{
s=0;
p2=i+1;
}
}
fout<<smax<<" "<<p<<" "<<u;
return 0;
}