Cod sursa(job #1459198)
Utilizator | Data | 9 iulie 2015 12:41:27 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,s,a[6000001],i,maxi,j,l,c;
int main()
{
f>>n;
s=0;
for(i=1; i<=n; i++)
f>>a[i];
while(j<=n)
{
j++;
if(s<0)
{
i=j;
s=a[i];
}
else
{
s+=a[j];
if(s>maxi)
{
maxi=s;
l=i;
c=j;
}
}
}
g<<maxi<<" "<<l<<" "<<c<<'\n';
f.close(); g.close();
}