Pagini recente » Cod sursa (job #2542616) | Cod sursa (job #2571257) | Cod sursa (job #3252851) | Cod sursa (job #2211824) | Cod sursa (job #1145299)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
short int N, v[6000000];
void read()
{
int sum = 0, bestL = 0, bestI = 0;
int bestSum = -999999;
fin >> N;
for(int i = 0; i < N; i++)
{
fin >> v[i];
sum += v[i];
if (sum < v[i])
{
sum = v[i];
bestI = i;
}
else if (sum > bestSum)
{
bestSum = sum;
bestL = i;
}
}
bestI += 1;
bestL += 1;
fout << bestSum << " " << bestI << " " << bestL;
}
int main()
{
read();
return 0;
}