Codeforces Round #171 (Div. 2) 279B - Books Solution




Problem Link:  https://codeforces.com/contest/279/problem/B  

Solution in C++:

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long  n,t,i,j=0,s=0,c=0;
    cin>>n>>t;
    long long a[n+9];
    for(i=0; i<n; i++)
    {
        cin>>a[i];
    }
    for(i=0; i<n; i++)
    {
        s+=a[i];
        if(s<=t)
            c++;
        else
        {
            s-=a[j];
            j++;
        }
    }
    cout<<c<<endl;
}






No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.