제출 #1164734

#제출 시각아이디문제언어결과실행 시간메모리
1164734MuhammadSaramRabbit Carrot (LMIO19_triusis)C++20
0 / 100
11 ms452 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { int n,R; cin>>n>>R; int a[n+1];a[0]=0; for (int i=1;i<=n;i++) cin>>a[i]; int ans=0; for (int i=0;i<n;i++) for (int j=i+1;j<=n;j++) if (a[j]-a[i]>R*(j-i)) ans++; cout<<ans<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...