Cod sursa(job #1856656)
| Utilizator | Data | 25 ianuarie 2017 11:41:37 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,a[6000005],i,max1,st,dr,sum,poz;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
sum=a[1];
max1=sum;
st=1;
dr=1;
for(i=2;i<=n;i++)
{
if(sum<0)
{
sum=a[i];
poz=i;
}
else
sum+=a[i];
if(sum>max1)
{
max1=sum;
st=poz;
dr=i;
}
}
g<<max1<<" "<<st<<" "<<dr;
return 0;
}
