Pagini recente » Cod sursa (job #657857) | Cod sursa (job #3237177) | Cod sursa (job #2447456) | Cod sursa (job #1315706) | Cod sursa (job #3218438)
#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;
in>>n;
for(int i=0; i<n; ++i)
in>>s[i];
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 min;
if(s[0]<0)
min=s[0];
else
min=0;
int bestsum=-MAX, poz1=0, poz2=0;
for(int i=0; i<n; ++i)
{
best[i]=s[i]-min;
if(min>s[i])
{
min=s[i];
poz1=i+1;
}
if(bestsum<best[i])
{
bestsum=best[i];
poz2=i;
}
}
out<<bestsum<<" "<<poz1+1<<" "<<poz2+1; //eu incep cu vectorul de la 0
return 0;
}