23pYvW - Online C++0x Compiler & Debugging Tool

#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl
inline int power(int a, int b) {
    int x = 1;
    while (b) {
        if (b & 1) x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

//_ ***************************** START Below *******************************

vector<int> a;

pair<int,int> consistency(int n, int k){

    //* k = total*x + y
    //* [ _ _ _ _ ( _ _ _]    [ ] [ ] ... [ ]     [ _ _ _) _ _ _ _ ]
    //*              y1            n * x        y2
    //*  y1 + y2 == y

    //*             l
    //* [ _ _ _ _ ( _ _ _] [ _ _ _) _ _ _ _ ]
    //*                   y

    int total = 0;
    for(int i=0; i<n; i++) total += a[i];
    int x = k/total;
    int y = k%total;
    k = y;

    if(y==0) return {1, x*n};


    vector<int> b(a);
    for(int i=0; i<n; i++){
        b.push_back(a[i]);
    }
    int m = b.size();


    int minLen = INT32_MAX;
    int left = -1;
    int sum = 0;

    int s = 0, e = 0;
    while(e<m){
        sum += b[e];

        if(sum < k){
            e++;
        }
        else{
            while(s<=e && sum >= k){
                int len = e-s+1;
                if(len < minLen){
                    minLen = len;
                    left = s+1;
                }
                sum -= b[s];
                s++;
            }
            e++;
        }
    }

    return {left, x*n + minLen};
}


void solve() {

    int n, k;
    cin>>n >> k;

    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];

    auto ans = consistency(n, k);

    cout << ans.first << " " << ans.second << endl;


}


int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}