Cod sursa(job #1520306)
Utilizator | Data | 8 noiembrie 2015 16:31:53 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <limits.h>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int Min,x,sol;
int s[6000001];
int pozi,pof,n,i,ind;
int main()
{
fin>>n;
Min=0;
for(i=1;i<=n;i++)
fin>>s[i];
sol=LONG_LONG_MIN;
for(i=1;i<=n;i++)
{
s[i]=s[i]+s[i-1];
if(Min>s[i-1])
{
Min=s[i-1];
ind=i;
}
if(sol<s[i]-Min)
{
sol=s[i]-Min;
pozi = ind;
pof=i;
}
}
fout<<sol<<" "<<pozi<<" "<<pof;
return 0;
}