Pagini recente » Cod sursa (job #2668892) | Cod sursa (job #1252422) | Cod sursa (job #2731704) | Cod sursa (job #2985398) | Cod sursa (job #3218463)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
const int MAX = 6000000;
int s[MAX+1], best[MAX+1];
int main()
{
int n, ok=1; //dc toate nr sunt negative
in>>n;
for(int i=0; i<n; ++i)
{
in>>s[i];
if(s[i]>=0)
ok=0;
}
if(ok==1)
{
int maxi=-1e9, st=0;
for(int i=0; i<n; ++i)
{
if(s[i]>maxi)
{
maxi=s[i];
st=i;
}
}
out<<maxi<<" "<<st+1<<" "<<st+1<<'\n'; //caz particular cand toate sunt negative
return 0;
}
for(int i=1; i<n; ++i)
s[i]=s[i]+s[i-1];
// cout<<"sume partiale "<<'\n';
//for(int i=0; i<n; ++i)
//cout<<s[i]<<" ";
int minim=0;
int bestsum=-1e9, poz1=0, poz2=0, st_ans=0;
for(int i=0; i<n; ++i)
{
best[i]=s[i]-minim;
if(minim>s[i])
{
minim=s[i];
poz1=i+1;
}
if(bestsum<best[i])
{
// cout<<bestsum <<' ' <<best[i]<<' '<<minim<<' '<<poz1<<' '<<i<<'\n';
bestsum=best[i];
st_ans=poz1;
poz2=i;
}
}
out<<bestsum<<" "<<st_ans+1<<" "<<poz2+1; //eu incep cu vectorul de la 0
return 0;
}