Pagini recente » Cod sursa (job #2781573) | Cod sursa (job #2377311) | Cod sursa (job #2935627) | Cod sursa (job #1191583) | Cod sursa (job #1612140)
#include <fstream>
using namespace std;
int s[6000002], v, i, j, maxim, u, p, n;
int main () {
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for (i=1;i<=n;i++) {
fin>>v;
s[i] = s[i-1] + v;
}
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;
}