Cod sursa(job #895263)
Utilizator | Data | 27 februarie 2013 10:42:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int x[6000001];
int n;
int main()
{
int sg=0,inceput,sfarsit,i,s,j;
in>>n;
for(i=0;i<n;i++)
{
in>>x[i];
}
for(i=0;i<n;i++)
{
s=0;
for(j=i-1;j>=0;j--)
{
s=s+x[j];
if(s>sg)
{
sg=s;
if(j<inceput)inceput=j;
if(i<sfarsit)sfarsit=i;
}
}
}
out<<sg<<" "<<inceput+1<<" "<<sfarsit;
in.close();
out.close();
return 0;
}