Cod sursa(job #1129510)
Utilizator | Data | 27 februarie 2014 22:48:59 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n,i,j,v[100],s=0,max,a,b;
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
}
max=v[1];
for(i=1;i<=n;i++)
{ s=v[i];
for(j=i+1;j<=n;j++)
{
if(s+v[j]>0) s=s+v[j];
else break;
if(s>max) { a=i;
b=j;
max=s; }
}
}
g<<max<<" "<<a<<" "<<b;
}