Cod sursa(job #3151961)

Utilizator KaleemRazaSyedKaleem Raza Syed KaleemRazaSyed Data 23 septembrie 2023 13:07:57
Problema Secventa 2 Scor 40
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.79 kb
#include<fstream>

using namespace std;

ifstream cin("secv2.in");
ofstream cout("secv2.out");

const int N = 500010, inf = 1.5e9;
int PS[N], PPSM[N], IPPSM[N];


int main()
{
  int n, k;
  cin >> n >> k;
  for(int i = 1; i <= n; i ++ )
    cin >> PS[i];

  for(int i = 1; i <= n; i++)
    PS[i] += PS[i-1]; // PS is in 1 based according to my 0 based array a

  PPSM[0] = inf;
  for(int i = 1; i<= n; i ++)
    {
      if(PS[i] < PPSM[i-1])
	PPSM[i] = PS[i], IPPSM[i] = i;
      else
	PPSM[i] = PPSM[i-1], IPPSM[i] = IPPSM[i-1];
    }// PPSM is zero based accordingly to my PS array

  int ans = -inf, e = -1, s = -1;
  for(int i = k; i <= n; i++)
    if(ans < PS[i] - PPSM[i-k])
      ans = PS[i] - PPSM[i-k] , e = i, s = IPPSM[i-k] + 1;
  cout << s << ' ' << e << ' ' << ans << '\n';
  
  return 0;
}