Cod sursa(job #1001523)
| Utilizator | Data | 25 septembrie 2013 12:07:20 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream d("ssm.in");
ofstream o("ssm.out");
int a[6000000],i,j,k,n,s,smax=0,imax=0,jmax=0;
int main()
{
d>>n;
for(i=1;i<=n;i++)
d>>a[i];
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
{
s=0;
for(k=i;k<=j;k++)
s+=a[k];
if(s>smax)
{
smax=s;
imax=i;
jmax=j;
}
}
o<<smax<<' '<<imax<<' '<<jmax;
return 0;
}
