Pagini recente » Cod sursa (job #85091) | Cod sursa (job #1627992) | Cod sursa (job #3286936) | Cod sursa (job #1714156) | Cod sursa (job #1515819)
#include <fstream>
using namespace std;
int n,i,v[6000002],s[6000002],maxim,j,p,u;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main (){
fin>>n;
for(i=1;i<=n;i++){
fin>>v[i];
s[i] = s[i-1] + v[i];
}
for (i=1;i<n;i++){
for (j=i;j<=n;j++){
if ((s[j]-s[i-1]) > maxim){
maxim = (s[j]-s[i-1]);
p = i;
u = j;
}
}
}
fout<<maxim<<" "<<p<<" "<<u;
return 0;
}