Cod sursa(job #1868903)
| Utilizator | Data | 5 februarie 2017 13:52:28 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
int v[6000001],s[6000001];
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;
}
