Cod sursa(job #1829277)
| Utilizator | Data | 14 decembrie 2016 18:56:53 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[6000005],sp[6000005];
int main()
{
int n,i,j,a,b,maxx,s=0;
f>>n;
maxx=INT_MIN;
for(i=1;i<=n;i++)
{
f>>v[i];
sp[i]=sp[i-1]+v[i];
}
for(i=j;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
s=sp[j]-sp[i-1];
if(s>maxx)
{
maxx=s;
a=i;
b=j;
}
}
}
g<<maxx<<" "<<a<<" "<<b;
return 0;
}
