Pagini recente » Cod sursa (job #1305840) | Robert Hangu | Istoria paginii utilizator/rar3s | Cod sursa (job #1062968) | Cod sursa (job #1519261)
#include<iostream>
#include<fstream>
using namespace std;
int N;
int k[6000007];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>N;
int v[6000007];
int u[6000007];
int min;
int max = -6000007;
int S = 0, i, j, k1;
for(i = 1 ; i <= N ; i++)
f>>v[i];
for(i = 2 ; i <= N ; i++)
{
min = 6000007;
S = 0;
for(j = 1 ; j < i ; j++)
{
S = S + v[j];
if ( S < min )
{min = S;
k[i] = j + 1;
}
}
u[i] = S + v[i] - min;
}
u[1] = v[1];
k[1] = 1;
for ( i = 1 ; i <= N ; i++)
if( u[i] > max )
{
max = u[i];
k1 = i;
}
g<<max<<" "<<k[k1]<<" "<<k1<<endl;
return 0;
}