Pagini recente » Cod sursa (job #1731606) | Cod sursa (job #1235249) | Cod sursa (job #1944818) | Cod sursa (job #930918) | Cod sursa (job #2800705)
//#include<fstream>//var I programare dinamica sum[i] = Max(sum[i-1] + a[i], a[i]).
//using namespace std;
//ifstream f("ssm.in");
//ofstream g("ssm.out");
//int n,i,maxi,x,sum,pi,pf,p;
//int main()
//{
// f>>n>>x;
// sum=x;p=1;maxi=-2000000000;
// for(i=2;i<=n;i++)
// {
// f>>x;
// if(sum>=0)sum+=x;
// else{ sum=x; p=i; }
// if(maxi<sum){maxi=sum;pi=p;pf=i;}
// }
// g<<maxi<<" "<<pi<<" "<<pf;
// return 0;
//}
//var II S[i] - Min(S[j]), j < i.
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,maxi,mini,x,sum,pi,pf,p;
int main()
{
f>>n;
maxi=-2000000000;mini=0;p=1;
for(i=1;i<=n;i++)
{
f>>x;
sum=sum+x;
if(sum-mini>maxi){ maxi=sum-mini; pi=p; pf=i; }
if(sum<mini){ mini=sum; p=i+1; }
}
g<<maxi<<" "<<pi<<" "<<pf;
return 0;
}