Pagini recente » Cod sursa (job #2065410) | Cod sursa (job #644239) | Cod sursa (job #1860078) | Cod sursa (job #1252086) | Cod sursa (job #2461608)
#include <fstream>
using namespace std;
ifstream fin( "ssm.in" );
ofstream fout( "ssm.out" );
const int NMAX = 6000000;
int ssm[NMAX + 1];
int main() {
int n, i, a, sol, first, sol1, sol2;
fin >> n;
first = 1;
sol = 0;
for( i = 1; i <= n; ++i ){
fin >> a;
if( ssm[i - 1] + a < 0 )
first = i;
ssm[i] = max( ssm[i - 1] + a, 0 );
if( ssm[i] == a )
first = i;
if( sol < ssm[i] ){
sol = ssm[i];
sol1 = first;
sol2 = i;
}
}
fout << sol << " " << sol1 << " " << sol2;
return 0;
}