Pagini recente » Cod sursa (job #2622106) | Cod sursa (job #605276) | Cod sursa (job #966811) | Cod sursa (job #1816585) | Cod sursa (job #1868900)
#include <fstream>
using namespace std;
int v[6 000 001],s[6 000 001];
int main()
{
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,bestSum=0,sumMin=0,sumCurent,i,j,a,sfarsit,start;
in>>n;
for(i=1; i<=n; ++i)
in>>v[i];
for(i=1; i<=n; ++i)
s[i]+=s[i-1]+v[i];
j=0;
for(i=1; i<=n; ++i) {
sumCurent=s[i]-s[j];
if(s[i]<sumMin){
sumMin=s[i];
j=i;
}
if(bestSum<sumCurent){
bestSum=sumCurent;
sfarsit=i;
start=j+1;
}
}
out<<bestSum<<" "<<start<<" "<<sfarsit;
return 0;
}