Cod sursa(job #1348246)
Utilizator | Havlex Entertainment HAVLEX | Data | 19 februarie 2015 16:29:54 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int i,j,s[100000],x,n,imax,jmax,max;
f>>n;
f>>s[1];
for (i=2;i<=n;i++)
{
f>>x;
s[i]=s[i-1]+x;
}
max=s[1]; imax=1; jmax=1;
for (i=2;i<=n;i++)
{
for (j=i-1;j>=1;j--)
if (s[i]-s[j]>max)
{
max=s[i]-s[j];
imax=j+1; jmax=i;
}
}
g<<max<<" "<<imax<<" "<<jmax<<"\n";
return 0;
}