Cod sursa(job #2511386)

Utilizator MihclerioVladimir Chim Mihclerio Data 18 decembrie 2019 21:39:13
Problema Subsecventa de suma maxima Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.96 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 dp[n+3],nr[n+3];
  cin>>dp[1];
  nr[1]=1;
  int mx=-(1e9),pos=1;
  for(int i=2;i<=n;i++)
  {
    int x;
    cin>>x;
    if(dp[i-1]+x>=x)
    {
      dp[i]=dp[i-1]+x;
      nr[i]=nr[i-1]+1;
    } else
    {
      dp[i]=x;
      nr[i]=1;
    }
    if(dp[i]>mx)
    {
      mx=dp[i];
      pos=i;
    } else
    if(dp[i]==mx && nr[i]<nr[pos])
    {
      pos=i;
    }
  }
  cout<<dp[pos]<<" "<<pos-nr[pos]+1<<" "<<pos;
}