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