Cod sursa(job #1655939)
Utilizator | Data | 18 martie 2016 15:26:25 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
int v[6000001],n,i,suma,maxim=-32000,beg,sum,sfarsit,idx;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
if(sum<0)
{
sum=v[i];
idx=i;
}
else
{
sum=sum+v[i];
}
if(sum>maxim)
{
maxim=sum;
beg=idx;
sfarsit=i;
}
}
g<<maxim<<" "<<beg<<" "<<sfarsit;
}