Pagini recente » Cod sursa (job #628877) | Istoria paginii arhiva | Cod sursa (job #196270) | Cod sursa (job #3160368) | Cod sursa (job #1690995)
#include <fstream>
#include <deque>
using namespace std;
int n,i,j,s,min1,max1=0,v[6000001],t,l,c;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
s=0;min1=9999999;
for(j=1;j<=i;j++)
{
s=s+v[j];
if(s<min1){min1=s;t=j+1;}
}
if(max1<s-min1){max1=s-min1;l=t;c=i;}
}
g<<max1<<" "<<l<<" "<<c;
return 0;
}