Pagini recente » Cod sursa (job #1297973) | Cod sursa (job #132597) | Cod sursa (job #2035931) | Cod sursa (job #3184098) | Cod sursa (job #2186106)
#include<bits/stdc++.h>
using namespace std;
int best[6000000],a[6000000];
int main(){
int n;
int i;
int beg,end1,it;
cin>>n;
for (i = 1; i <= n; ++ i)
cin>>a[i];
int bestSum = a[1];
for (i = 1; i <= n; ++ i) {
if (best[i] < best[i-1] + a[i]){
best[i] = best[i-1] + a[i];
}
else{
best[i]=a[i];
it=i;
}
if (bestSum < best[i]){
bestSum = best[i];
beg=it;
end1=i;
}
}
cout<<bestSum<<" "<<beg<<" "<<end1;
}