Pagini recente » Cod sursa (job #2543913) | Cod sursa (job #992205) | Cod sursa (job #3187435) | Cod sursa (job #3220233) | Cod sursa (job #2582031)
#include <iostream>
#include <fstream>
using namespace std;
int n,mini,maxi,x,s[600001],i,j;
pair<int,int>poz;
ifstream fin("secvsummax.in");
ofstream fout("secvsummax.out");
int main()
{
fin>>n;
s[0]=0;
for (i=1;i<=n;i++)
{
fin>>x;
s[i]=s[i-1]+x;
}
maxi=s[1];
mini=s[1];
poz.first=1;
poz.second=1;
for (j=1;j<=n;j++)
{
if (s[j]-mini>maxi)
{
maxi=s[j]-mini;
poz.second=j;
}
if (s[j]<mini)
{
mini=s[j];
poz.first=j;
}
mini=min(s[j],mini);
}
fout<<poz.second-(poz.first+1)<<" "<<maxi;
}