Cod sursa(job #1893205)
| Utilizator | Data | 25 februarie 2017 15:45:23 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int N;
int main()
{
fin>>N;
int x,bestSum=-1<<30,sum=0,begin,end,index;
for(int i=1;i<=N;i++)
{
fin>>x;
if(sum<0)
sum=x, index=i;
else
sum+=x;
if(bestSum<sum)
bestSum=sum, begin=index, end=i;
}
fout<<bestSum<<" "<<begin<<" "<<end;
return 0;
}
