luogu P1007 独木桥
生活随笔
收集整理的這篇文章主要介紹了
luogu P1007 独木桥
小編覺得挺不錯(cuò)的,現(xiàn)在分享給大家,幫大家做個(gè)參考.
二次聯(lián)通門 :?luogu P1007 獨(dú)木橋
?
?
?
?
/*luogu P1007 獨(dú)木橋模擬 */ #include <cstdio>inline int min (int a, int b) {return a < b ? a : b; }inline int max (int a, int b) {return a > b ? a : b; }void read (int &now) {register char word = getchar ();for (now = 0; word < '0' || word > '9'; word = getchar ());for (; word >= '0' && word <= '9'; now = now * 10 + word - '0', word = getchar ()); }int main (int argc, char *argv[]) {int L, N;read (L);read (N);int x, y;if (!N){printf ("0 0");return 0;}int Max_Answer = -1, Min_Answer = -1;for (int i = 1; i <= N; i ++){read (x);Max_Answer = max (Max_Answer, max (L - x + 1, x));Min_Answer = max (Min_Answer, min (L - x + 1, x));}printf ("%d %d", Min_Answer, Max_Answer);return 0; }?
轉(zhuǎn)載于:https://www.cnblogs.com/ZlycerQan/p/7168717.html
總結(jié)
以上是生活随笔為你收集整理的luogu P1007 独木桥的全部內(nèi)容,希望文章能夠幫你解決所遇到的問題。
- 上一篇: 菏泽东城云玺楼盘地址在哪里?
- 下一篇: hibernate缓存机制