Pagini recente » Cod sursa (job #2023471) | Cod sursa (job #421030) | Cod sursa (job #1538722) | Cod sursa (job #1058082) | Cod sursa (job #2557905)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[1005],s[1005],n,i,j,maxim,pozi,pozj;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
s[i]=s[i-1]+v[i];
}
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
if(s[j]-s[i-1]>maxim)
{
maxim=s[j]-s[i-1];
pozi=i;
pozj=j;
}
}
}
g<<maxim<<" "<<pozi<<" "<<pozj;
return 0;
}