Pagini recente » Cod sursa (job #91947) | Cod sursa (job #718331) | Cod sursa (job #905041) | Cod sursa (job #1907138) | Cod sursa (job #1522217)
#include<iostream>
#include<fstream>
using namespace std;
int N;
int k[6000065];
int v[6000005];
int u[6000005];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>N;
int min;
int max;
int S, i, j, k1;
f>>v[1];
S = 0;
u[1] = v[1];
min = v[1];
k[1] = 1;
for(i = 2 ; i <= N ; i++)
{f>>v[i];
S = S + v[i-1];
if (S < min)
{min = S;
k[i] = i;
}
else
k[i] = k[i-1];
u[i] = S + v[i] - min;
}
max = u[1];
k1 = 1;
for ( i = 2 ; i <= N ; i++)
if( u[i] > max )
{
max = u[i];
k1 = i;
}
g<<max<<" "<<k[k1]<<" "<<k1<<endl;
return 0;
}