Cod sursa(job #1995784)
Utilizator | Data | 29 iunie 2017 08:39:37 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.95 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000001];
int main()
{
int n,i,j,s=0,k,mx=-(1<<31-1),a,b;
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
for(i=0; i<=n; i++)
for(j=1; j<=n; j++)
{
for(k=j; k<=j+i; k++)
s+=v[k];
if(s>mx)
{
mx=s;
a=j;
b=j+i;
}
else if(s==mx)
{
mx=s;
if(j<a)
{
a=j;
b=j+i;
}
else if(j==a)
{
if(i<b-a)
{
a=j;
b=j+i;
}
}
}
s=0;
}
out<<mx<<" "<<a<<" "<<b;
return 0;
}