Cod sursa(job #2146618)
Utilizator | Data | 28 februarie 2018 08:42:57 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n,s,smax,p,pmax,a[6000005],i,c;
int main()
{f>>n;s=0;smax=0;pmax=1;p=1,c=0;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{if(s+a[i]>=a[i]) s=s+a[i],c++;
else s=a[i],p=i,c=0;
if(s>smax) smax=s,pmax=p;
}
g<<smax<<" "<<pmax<<" "<<pmax+c-1;
return 0;
}