Cod sursa(job #2670057)
| Utilizator | Data | 8 noiembrie 2020 20:14:49 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
#define f ' '<<i1m<<' '<<i2m
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int x=-2000000005,n,i1,i2,s,i,sm,i1m,i2m,nm;
void v()
{
if(s>sm){
sm=s;
i1m=i1;
i2m=i2;}}
int main()
{
fin>>n;
i1=1;
for(i=1;i<=n;i++){
fin>>x;
i2=i;
if(x>nm){
nm=x;}
if(s<0){
s=x;
v();
i1=i;}
else{
s=s+x;
v();}}
if(nm<0)
fout<<nm<<f;
else
fout<<sm<<f;
return 0;
}
