Cod sursa(job #1480211)
Utilizator | Data | 2 septembrie 2015 11:28:12 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
const int NMAX=50005;
ifstream f("secv2.in");
ofstream g("secv2.out");
int a[NMAX];
int main()
{
int n,k;
f>>n>>k;
for(int i=1;i<=n;i++)
f>>a[i];
int s=0,maax=-99999,dr=0,st=0,j;
for(int i=1;i<=n;i++)
{
s+=a[i];
if(s<0)
{
j=i;
s=a[i];
}
if(s>maax)
{
st=j;
dr=i;
maax=s;
}
}
g<<st<<" "<<dr<<" "<<maax;
return 0;
}