Cod sursa(job #2861907)
Utilizator | Data | 4 martie 2022 18:10:59 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,x,s,M,st,dr,ST,DR;
int main()
{
f>>n;
f>>x;
s=M=x;
ST=DR=1;
for(i=2;i<=n;i++)
{
f>>x;
if(s+x>=x)
{
dr++;
s=s+x;
}
else
{
st=dr=i;
s=x;
}
if(s>M)
{
M=s;
ST=st;
DR=dr;
}
}
g<<M<<" "<<ST<<" "<<DR;
return 0;
}