Cod sursa(job #1608200)
Utilizator | Data | 21 februarie 2016 21:49:46 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
using namespace std;
int a[10000000],bests=-20000000,sum=0,ind,beg,endd,i,n;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{
if(sum<0)
{
sum=a[i];
ind=i;
}
else
sum=sum+a[i];
if(bests<sum)
{
bests=sum;
beg=ind;
endd=i;
}
}
g<<bests<<" "<<beg<<" "<<endd<<"\n";
}