Cod sursa(job #1973014)
Utilizator | Data | 24 aprilie 2017 11:22:02 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 30 |
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 n,m,i,j,s[6000005],a[6000005],mx,st,dr;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>a[i];
s[i]=s[i-1]+a[i];
}
for(i=1;i<=n;i++)
{
for(j=i-1;j>=1;j--)
{
if(s[i]-s[j-1]>mx)
{
mx=s[i]-s[j-1];
st=j;
dr=i;
}
}
}
g<<mx<<" "<<st<<" "<<dr;
return 0;
}