Cod sursa(job #412669)
| Utilizator | Data | 5 martie 2010 21:08:20 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include<cstdio>
using namespace std;
int main(){
int n,s,i;
int bestsum=-int(2e9), sum = 0, beg, end, idx;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;++i){
scanf("%d",&s);
if(sum<0) sum=s, idx=i;
else sum+=s;
if(bestsum<sum) bestsum=sum, beg=idx, end=i;
}
printf("%d %d %d",bestsum,beg,end);
return 0;
}
