Cod sursa(job #2657370)
Utilizator | Data | 10 octombrie 2020 13:49:06 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, Smax, St, Dr, smax, st, dr, smin, imin, v, sum;
int main()
{
f>>n;
Smax = 1<<31;
for(int i=1; i<=n; i++)
{
f>>v;
sum+=v;
smax=sum-smin;
st=imin;
dr=i;
if(smax > Smax)
{
Smax=smax;
St = st;
Dr = dr;
}
if(sum<smin)
{
smin=sum;
imin=i;
}
}
g<<Smax<<' '<<St+1<<' '<<Dr<<'\n';
return 0;
}