Cod sursa(job #2509520)

Utilizator MihclerioVladimir Chim Mihclerio Data 14 decembrie 2019 12:22:29
Problema Subsecventa de suma maxima Scor 85
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.9 kb
#include<bits/stdc++.h>

#define all(s) s.begin(),s.end()
#define rc(x) return cout<<x<<endl,0
#define forn(i,n) for(int i=0;i<int(n);i++)

#define pb push_back
#define mp make_pair
#define fr first
#define sc second

typedef long long ll;
typedef long double ld;

const int nmax=1025;
const int mod=9973;
const ll inf=0x3f3f3f3f3f3f3f3f;

using namespace std;

int main()
{
  ios_base::sync_with_stdio(0); cin.tie(0);
  freopen("ssm.in","r",stdin);
  freopen("ssm.out","w",stdout);
  int n;
  cin>>n;
  int v[n+3];
  v[0]=0;
  int mn=2000000000,pos=0;
  for(int i=1;i<=n;i++)
  {
    cin>>v[i];
    v[i]+=v[i-1];
    if(v[i]<mn) mn=v[i],pos=i;
  }
  int sol=-2000000000,st,dr;
  for(int i=1;i<=n;i++)
  {
    int aux,st1,dr1;
    if(i>pos) aux=v[i]-v[pos],st1=pos+1,dr1=i; else aux=v[i],st1=1,dr1=i;
    if(aux>sol) sol=aux,st=st1,dr=dr1;
  }
  cout<<sol<<" "<<st<<" "<<dr;
}