1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<cmath> 5 #include<queue> 6 using namespace std; 7 const int MAXN=6001; 8 void read(int &n) 9 { 10 char c='+';int x=0;bool flag=0; 11 while(c<'0'||c>'9') 12 {c=getchar();if(c=='-')flag...
1#include<iostream>2#include<cstdio>3#include<cstring>4#include<cmath>5#include<queue>6usingnamespacestd;7constintMAXN=6001;8voidread(int&n)9{10charc='+';intx=0;boolflag=0;11while(c<'0'||c>'9')12{c=getchar();if(c=='-')flag=1;}13while(c>='0'&&c<='9')14{x=x*10...
[USACO06FEB]奶牛零食Treats for the Cows 思路: 区间DP; 代码: #include <bits/stdc++.h>usingnamespacestd;#definemaxn 2005#definell long longll n,ai[maxn],dp[maxn][maxn],sum[maxn]; inlinevoidin(ll &now) {charCget=getchar();now=0;while(Cget>'9'||Cget<'0')Cget=getchar();...
可以吃一些全麦面包,喝牛奶,注意吃的 零食 不要太硬,太冰凉,含糖少的,不是麻辣的就可以 巧克力
(c >= '0' && c <= '9') x = x * 10 + (c ^ '0'), c = getchar(); x*= f; return *this; } }io; using namespace std; const int N = 2007; int f[N][N], a[N]; int main(){ //FileOpen(); int n; io >> n; R...
} 代码 #include<cstdio>#include<cstdlib>#include<cstring>#include<cctype>#include<algorithm>#include<queue>#definell long long#defineri register intusingstd::min; usingstd::max; template <classT>inlinevoidread(T &x){ x=0;intne=0;charc;while(!isdigit(c=getchar()))ne=c=='-'; ...