Pagini recente » Cod sursa (job #1958520) | Cod sursa (job #554506) | Cod sursa (job #2947114) | Cod sursa (job #3121294) | Cod sursa (job #1687697)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMAX = 6000009;
int n; int v[NMAX];
int smax[NMAX]; int st[NMAX];
int main() {
fin >> n;
for(int i = 1; i <= n; ++i)
fin >> v[i];
smax[0] = -0x3f3f3f3f;
for(int i = 1; i <= n; ++i) {
if( v[i] + smax[i - 1] < v[i] ) {
st[i] = i;
smax[i] = v[i];
} else {
smax[i] = smax[i - 1] + v[i];
st[i] = st[i - 1];
}
}
int maxi = 1;
for(int i = 1; i <= n ; ++i)
if(smax[maxi] < smax[i])
maxi = i;
fout << smax[maxi] << ' ' << st[maxi] << ' ' << maxi << '\n';
return 0;
}