Cod sursa(job #2410344)
Utilizator | Data | 19 aprilie 2019 22:25:24 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream g("ssm.in");
ofstream f("ssm.out");
int n,i,v,s[7000005],sum=-int(2e9),mini=0,idx,beg,sf;
int main()
{
g>>n;
for(i=1;i<=n;i++)
{
g>>s[i];
}
for(i=1;i<=n;i++)
{
s[i]+=s[i-1];
if (sum<s[i]-mini)
{
sum=s[i]-mini;
beg=idx+1;
sf=i;
}
if(mini>s[i])
{
mini=s[i];
idx=i;
}
}
f<<sum<<" "<<beg<<" "<<sf;
return 0;
}