제출 #165414

#제출 시각아이디문제언어결과실행 시간메모리
165414Atill83Vudu (COCI15_vudu)C++14
42 / 140
55 ms10744 KiB
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int a[MAXN];
ll pre[MAXN];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("../IO/int.txt","r",stdin);
        freopen("../IO/out.txt","w",stdout);
    #endif

    cin>>n;

    for(ll i = 0; i < n; i++){
        cin>>a[i];
        pre[i] = (i > 0 ? pre[i - 1] : 0) + a[i];
    }
    ll P;
    cin>>P;
    ll ans = 0;
    for(ll i = 0; i < n; i++){
        for(ll j = i; j < n; j++){
            ll cur = pre[j] - (i > 0 ? pre[i - 1] : 0);
            if(P*(j - i + 1) <= cur) 
                ans++;
        }
    }
    cout<<ans<<endl;
    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}
#Verdict Execution timeMemoryGrader output
Fetching results...