Cod sursa(job #1690764)
| Utilizator | Data | 15 aprilie 2016 18:22:44 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,j,imax;
long long x,sum[6000005];
long long Smax;
int main()
{
fin>>n;
sum[0]=0;
sum[1]=1;
for(i=1;i<=n;i++){
fin>>x;
sum[i]=max(sum[i-1]+x,x);
if(sum[i]>Smax){
Smax=sum[i];
imax=i;
}
}
fin.close();
fout<<Smax<<" ";
j=imax;
while(j>0&&sum[j]>=0)
j--;
j++;
fout<<j<<" "<<imax;
return 0;
}
