Pagini recente » Cod sursa (job #306080) | Cod sursa (job #135464) | Cod sursa (job #1058191) | Cod sursa (job #2296545) | Cod sursa (job #1584612)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
long long s,n,i,v[10001],a,b,k,j,maxi,l;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
k=0;
while(k<=n)
{
for(i=1;i<=n;i++)
{
s=v[i];
l=k;
j=i+1;
while(l!=0)
{
s=s+v[j];
l--;
j++;
}
if(s>maxi) {maxi=s;
b=j-1;
a=j-k-1;
}
// cout<<s<<" ";
}
k++;
}
g<<maxi<<" "<<a<<" "<<b;
return 0;
}