Cod sursa(job #1751690)
| Utilizator | Data | 1 septembrie 2016 19:09:01 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[6000001],n,i,s,p,q,maxim=-2000000000,pc;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>a[i];
}
p=q=1;
maxim=a[1];
s=a[1];
if(s<0)
{
s=0;
}
for(i=2;i<=n;i++)
{
if(s>=0)
{
s=s+a[i];
}
else
{
s=a[i];
pc=i;
}
if(s>maxim)
{
p=pc;
q=i;
maxim=s;
}
}
g<<maxim<<" "<<p<<" "<<q;
return 0;
}
