Cod sursa(job #2039053)
| Utilizator | Data | 14 octombrie 2017 10:50:56 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int s[6000000], suma=0, a, b, i, n, j, su[6000000];
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>s[i];
su[1]=s[1];
for(i=2;i<=n;i++)
su[i]=su[i-1]+s[i];
for(i=1;i<=n;i++)
{
for(j=i+i;j<=n;j++)
{
if(su[j]-su[i]>suma)
{
suma=su[j]-su[i-1];
a=i; b=j;
}
}
}
g<<suma<<" "<<a<<" "<<b;
return 0;
}
