Cod sursa(job #1662366)
Utilizator | Data | 24 martie 2016 18:35:19 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int x[30001],s,maxx;
int main()
{
int n,i,j,k,ii,jj;
f>>n;
for(i=1;i<=n;i++)
f>>x[i];
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
{
s=0;
for(k=i;k<=j;k++)
s=s+x[k];
if(s>maxx)
{
maxx=s;
ii=i;
jj=j;
}
}
g<<maxx<<" "<<ii<<" "<<jj;
return 0;
}