Cod sursa(job #1633600)
| Utilizator | Data | 6 martie 2016 12:30:37 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.84 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,x,v[6000002],a,b,s,i,j,suma;
int main()
{
fin>>n;
fin>>v[1];
suma=v[1];
for(i=2;i<=n;i++)
{
fin>>v[i];
suma=suma+v[i];
x=suma;
for(j=0;j<i;j++)
{
x=x-v[j];
if(s==x)
{
if((i-j-1)<(a-b))
{
a=j+1;
b=i;
}
}
if(x>s)
{
s=x;
a=j+1;
b=i;
}
}
}
// for(i=1;i<=n;i++)
// fout<<v[1];
fout<<s<<" "<<a<<" "<<b;
return 0;
}
