Cod sursa(job #1278455)
Utilizator | Data | 28 noiembrie 2014 21:55:14 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[6000009];
int main()
{
int n,i,s,k,maax=-2000000000,st,dr;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
for(int j=i;j<=n;j++)
{
s=0;
for(k=i;k<=j;k++)
s+=a[k];
if(s>maax)
{
maax=s;
st=i;
dr=j;
}
}
g<<maax<<" "<<st<<" "<<dr;
g<<"\n";
g.close();
return 0;
}