Pagini recente » Rezultatele filtrării | Rezultatele filtrării | Rezultatele filtrării | Cod sursa (job #3002704) | Cod sursa (job #2129813)
#include <iostream>
#include <fstream>
using namespace std;
long long s[6000001];
int v[6000001];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,maxi=1,maxj=1;
long long maxim,minim;
f>>n;
for (i=1;i<=n;i++)
f>>v[i];
s[1]=v[1];
for (i=2;i<=n;i++)
s[i]=s[i-1]+v[i];
maxim=s[1];
minim=s[1];
for (i=1;i<=n;i++)
if (s[i]>maxim)
{maxim=s[i];
maxi=i;}
for (i=1;i<=n;i++)
if (s[i]<minim&&i<maxi)
{minim=s[i];
maxj=i;}
g<<maxim-minim<<" "<<maxj+1<<" "<<maxi;
}