Dream

摘要： #include <algorithm>#include <iostream>#include<stdio.h>using namespace std;bool cmp(int a,int b){ if (a<b) return true; return false;}int n,m,num[50010];int main(){ int max,min,i,L,mid; while(scanf("%d%d%d",&L,&n,&m)!=EOF) { max=L;min=0;for(i=1;i<=n;i++ 阅读全文

摘要： #include <cstdio>#include <cstdlib>#include <iostream>using namespace std ;int min ( int x , int y ){ if ( x <= y ) return x ; return y ;}int max ( int a , int b ){ if ( a >= b ) return a ; return b ;}int main (){ __int64 n , m ; while ( scanf ( "%I64d %I64d" , & 阅读全文