Pagini recente » Cod sursa (job #1088859) | Cod sursa (job #322896) | Cod sursa (job #1930935) | Cod sursa (job #1667716) | Cod sursa (job #1782907)
#include <iostream>
#include <fstream>
using namespace std;
long long s[6000000],v[6000000];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n,maxi=-2147483648,poz1,poz2;
f>>n;
for(int i=1;i<=n;i++)
{
f>>v[i];
if(i==1) s[i]=v[i];
else s[i]=s[i-1]+v[i];
}
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
{
if(s[j]-s[i-1]>maxi){
maxi=s[j]-s[i-1];
poz1=i; poz2=j;
}
}
g<<maxi<<" "<<poz1<<" "<<poz2<<" ";
return 0;
}