Cod sursa(job #674579)
Utilizator | Data | 6 februarie 2012 15:42:22 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int s,i,n,a[6000003],smax,p,u,pr;
int main()
{
smax=-2000000000;
f>>n;
p=u=1;
for(i=1;i<=n;i++)
{
f>>a[i];
if(a[i]<s+a[i])
{s+=a[i];}
else
{
s=a[i];
p=i;
}
if(s>smax) {smax=s;u=i;pr=p;}
}
g<<smax<<' '<<pr<<' '<<u;
return 0;
}