Cod sursa(job #1669894)
| Utilizator | Data | 31 martie 2016 10:54:16 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<fstream>
#include<cstdio>
#define ll long long
#define MIN 99999999999999999
#define MAX -99999999999999999
using namespace std;
ll n,ma,mi,s[6000001],i,x,pi=1,pf=1;
int main()
{
freopen("ssm.in","r",stdin);
ofstream g("ssm.out");
scanf("%lld",&n);
for(i=1;i<=n;i++)
{scanf("%lld",&x);
s[i]=s[i-1]+x;}
mi=s[1];
ma=s[1];
for(i=1;i<=n;i++)
{
if(mi>s[i])
{
mi=s[i];
pi=i;
}
if(ma<s[i]-mi)
{
ma=s[i]-mi;
pf=i;
}
}
g<<ma<<" "<<pi+1<<" "<<pf;
return 0;
}
