AOJ 1600: Entrance Examination
問題
Entrance Examination | Aizu Online Judge
codefestival前の肩ならし
#include <bits/stdc++.h> #define REP(i,n) for(int i=0; i<(int)(n); ++i) #define FOR(i,k,n) for(int i=(k);i<(int)(n);++i) typedef long long int ll; using namespace std; int main(void) { int m, nmin, nmax; while(cin >> m >> nmin >> nmax && m) { vector<int> p(m); REP(i, m) scanf("%d", &p[i]); sort(p.begin(), p.end(), greater<int>()); int gap = 0; int ans = 0; for(int i=nmin-1; i<nmax; ++i) { if(p[i]-p[i+1] >= gap) { gap = p[i]-p[i+1]; ans = i+1; } } printf("%d\n", ans); } }