Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], skipTags: ["script","noscript","style","textarea","code"], processEscapes: true }});

Problem C
Medical Checkup

Students of the university have to go for a medical checkup, consisting of lots of checkup items, numbered 1, 2, 3, and so on.

Students are now forming a long queue, waiting for the checkup to start. Students are also numbered 1, 2, 3, and so on, from the top of the queue. They have to undergo checkup items in the order of the item numbers, not skipping any of them nor changing the order. The order of students should not be changed either.

Multiple checkup items can be carried out in parallel, but each item can be carried out for only one student at a time. Students have to wait in queues of their next checkup items until all the others before them finish.

Each of the students is associated with an integer value called health condition. For a student with the health condition $h$, it takes $h$ minutes to finish each of the checkup items. You may assume that no interval is needed between two students on the same checkup item or two checkup items for a single student.

Your task is to find the items students are being checked up or waiting for at a specified time $t$.

Input

The input consists of a single test case in the following format.

$n$ $t$
$h_1$
...
$h_n$

$n$ and $t$ are integers. $n$ is the number of the students ($1 \leq n \leq 10^5$). $t$ specifies the time of our concern ($0 \leq t \leq 10^9$). For each $i$, the integer $h_i$ is the health condition of student $i$ ($1 \leq h_ \leq 10^9$).

Output

Output $n$ lines each containing a single integer. The $i$-th line should contain the checkup item number of the item which the student $i$ is being checked up or is waiting for, at ($t+0.5$) minutes after the checkup starts. You may assume that all the students are yet to finish some of the checkup items at that moment.

Sample Input 1

3 20
5
7
3

Sample Output 1

5
3
2

Sample Input 2

5 1000000000
5553
2186
3472
2605
1790

Sample Output 2

180083
180083
180082
180082
180082

Solution in C++14 (judge verdict: Accepted)

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5+10;
ll a[maxn];
ll s[maxn];
int main(){
   ll n,time;
   scanf("%lld%lld",&n,&time);
  // ll sum=0;
   ll maxx=0;
   for(int i=1;i<=n;i++)
   {
       scanf("%d",&a[i]);
   }
   for(int i=1;i<=n;i++)
   {
       s[i]=s[i-1]+a[i];
       if(a[i]>maxx)
       {
           maxx=a[i];
       }
       if(time>=s[i])
       {
         printf("%lld\n",(time-s[i])/maxx+2);
       }
       else
       {
           printf("1\n");
       }
   }
  return 0;
}