关于解题思路

P1209 [USACO1.3] 修理牛棚 Barn Repair

6和7没过
by ice_spruce233 @ 2022-03-05 11:12:34


这题要特判m>c的时候
by Anahita @ 2022-03-08 21:29:08


@[ice_spruce233](/user/689927) 计算间隔时-1,计算结果时不要++ans,就没问题了 ```cpp #include <iostream> #include <algorithm> using namespace std; bool cmp(int a,int b){ return a>b; } int cow[202],ge[202]; int main(){ int m,s,c; cin >> m >> s >> c; for(int i = 0;i < c;i++){ cin >> cow[i]; } sort(cow,cow+c); for(int i = 0;i < c - 1;i++){ ge[i] = cow[i + 1] - cow[i]-1; //这里-1 } sort(ge,ge+c,cmp); int ans = cow[c - 1] - (cow[0] - 1); for(int i = 0;i < m - 1;i++){ ans-=ge[i]; //这里去掉++ans } cout << ans << endl; return 0; } ```
by sundyLIUXY @ 2022-08-14 11:18:59


|