Cod sursa(job #686970)
Utilizator | Data | 21 februarie 2012 23:32:44 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
long long a,b[6000001],i,n,m,p1,p2,c;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
f>>b[1]; c=1;
for(i=2; i<=n; i++)
{
f>>a;
if(b[i-1]>0)
{
b[i]=a+b[i-1];
}
else
{
b[i]=a;
c=i;
}
if(m<b[i])
{
m=b[i];
p1=c;
p2=i;
}
}
g<<m<<" "<<p1<<" "<<p2;
f.close();
g.close();
}