USACO 三道题目

三道3.1的题目，包括那道我觉得也算比较经典的shaping regions。如果有朝一日我还需要深入研究算法的话，我会用离散化和二维线段树代替冰块上浮法再把它做一遍。但今天就算了……第一道agrinet已经在之前写过了……

【score inflation】

/* ID: wangqia4 TASK: inflate LANG: C++ */ #include <fstream> using namespace std; const long NMAX = 10005; long f[NMAX]; inline long getmax(long a,long b) { if (a > b) return a; return b; } int main() { ifstream cin ("inflate.in"); ofstream cout ("inflate.out"); long v,n,i,j,w,c,ans = -1; cin >> v >> n; for (i = 0; i < n; i++) { cin >> w >> c; for (j = c; j <= v; j++) f[j] = getmax(f[j - c] + w,f[j]); } for (j = 0; j <= v; j++) if (f[j] > ans) ans = f[j]; cout << ans << endl; cin.close(); cout.close(); return 0; }

 

【humble numbers】

/* ID: wangqia5 TASK: humble LANG: C++ */ #include <fstream> #include <cstring> using namespace std; const int MMAX = 105; const long NMAX = 100005; const long INF = long ((1 << 31) - 1); long num[MMAX],st[MMAX],list[NMAX]; int main() { ifstream cin ("humble.in"); ofstream cout ("humble.out"); int m,n; long i,j,tmp; cin >> m >> n; for (int i = 0; i < m; i++) cin >> num[i]; list[0] = 1; memset(st,0,sizeof(st)); for (i = 1; i <= n; i++) { tmp = INF; for (j = 0; j < m; j++) { while ((st[j] < i) && (num[j] * list[st[j]] <= list[i - 1])) st[j]++; if ((st[j] < i) && (num[j] * list[st[j]] < tmp)) tmp = num[j] * list[st[j]]; } list[i] = tmp; } cout << list[n] << endl; cin.close(); cout.close(); return 0; }

 

【shaping regions】

/* ID: wangqia6 TASK: rect1 LANG: C++ */ #include <fstream> #include <algorithm> #include <cstring> using namespace std; const long NMAX = 2505; struct rec { long xa,ya,xb,yb,col; } rect[NMAX]; long ans[NMAX]; int n; void initdata() { ifstream cin ("rect1.in"); rect[0].col = 1; rect[0].xa = 0; rect[0].ya = 0; cin >> rect[0].xb >> rect[0].yb >> n; rect[0].xb--; rect[0].yb--; for (int i = 1; i <= n; i++) { cin >> rect[i].xa >> rect[i].ya >> rect[i].xb >> rect[i].yb >> rect[i].col; rect[i].xb--; rect[i].yb--; } cin.close(); return; } bool uncover(long ia,long ja,long ib,long jb,long x) { if (ia > rect[x].xb) return true; if (ib < rect[x].xa) return true; if (ja > rect[x].yb) return true; if (jb < rect[x].ya) return true; return false; } long calc(long ia,long ja,long ib,long jb,long now) { if (now > n) return (jb + 1 - ja) * (ib + 1 - ia); if (uncover(ia,ja,ib,jb,now)) return calc(ia,ja,ib,jb,now + 1); long tmp = 0; if (rect[now].xa > ia) { tmp += calc(ia,ja,rect[now].xa - 1,jb,now + 1); ia = rect[now].xa; } if (rect[now].xb < ib) { tmp += calc(rect[now].xb + 1,ja,ib,jb,now + 1); ib = rect[now].xb; } if (rect[now].ya > ja) { tmp += calc(ia,ja,ib,rect[now].ya - 1,now + 1); ja = rect[now].ya; } if (rect[now].yb < jb) tmp += calc(ia,rect[now].yb + 1,ib,jb,now + 1); return tmp; } void solve() { memset(ans,0,sizeof(ans)); for (int i = n; i >=0; i--) ans[rect[i].col] += calc(rect[i].xa,rect[i].ya,rect[i].xb,rect[i].yb,i + 1); return; } void outitdata() { ofstream cout ("rect1.out"); for (int i = 1; i < NMAX; i++) if (ans[i]) cout << i << ' ' << ans[i] << endl; cout.close(); return; } int main() { initdata(); solve(); outitdata(); return 0; }