Cod sursa(job #898195)
| Utilizator | Data | 28 februarie 2013 08:47:28 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,i,s,d,mxs,mxd,mx,sum,x;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n>>x;
mx=x;
sum=x;
for(i=2;i<=n;i++)
{
fin>>x;
if(sum>=0)
{
d=i;
sum+=x;
}
else
{
sum=x;
d=i;
s=i;
}
if(sum>mx)
{
mx=sum;
mxs=s;
mxd=d;
}
}
fout<<mx<<" "<<mxs<<" "<<mxd;
return 0;
}
