Online Judge
文章平均质量分 75
MrRoyLee
这个作者很懒,什么都没留下…
展开
-
(PAT)1003. Emergency (25)
#include#include#define INF 1<<10int n,m,so,ta;int cities[500+10][500+10];int teams[500+10];int dist[500+10];int byPass[500+10];int maxTeams[500+10];int difDist[500+10];bool visited[500+10];原创 2014-01-08 16:15:12 · 625 阅读 · 0 评论 -
(PAT)1004.Counting Leaves (30)
核心是个广度优先算法,利用C++的知识可以写的更简洁一点,为了联系C,故用数组代替,自己模拟一下队列以及记录当前层次以及下一层。#include#includeint n,m;int level[100+10];int family[100+10][100+10];int parse(char s[3]){ if(s[0]=='0')return (s[1]-'0');原创 2014-01-08 18:46:31 · 690 阅读 · 0 评论 -
(PAT)1005. Spell It Right (20)
#include#include#include using namespace std;int main(){ string eng[10]={"zero","one","two","three","four","five","six","seven","eight","nine"}; string s; cin>>s; int sum=0; f原创 2014-01-08 22:40:55 · 565 阅读 · 0 评论 -
(PAT)1007. Maximum Subsequence Sum
#include#include#include#includeusing namespace std;class Student{public: string sid; int checkin; int checkout; Student(string id,int m_checkin,int m_checkout):sid(id),checki原创 2014-01-10 10:15:32 · 500 阅读 · 0 评论 -
(PAT)1008.Elevator
#include#include#include#includeusing namespace std;int main(){ int n; vector vec; int mvUp=6; int mvDown=-4; int stop=5; cin>>n; int k=n; while(k) {原创 2014-01-10 11:34:27 · 603 阅读 · 0 评论 -
(PAT)1007. Maximum Subsequence Sum
#include#include#include#includeusing namespace std;int main(){ int n; vector numVec; vector maxSumEnd; cin>>n; int k=n; int curSum=0; int maxSum=0; int num;原创 2014-01-10 11:15:14 · 544 阅读 · 0 评论 -
(PAT)1009. Product of Polynomials (25)
#include#include#include#include#include#include#includeusing namespace std;class Pol{public : map coe; Pol operator*(const Pol& pol_b) { Pol pol_c; map::const_iterator it_a=coe.be原创 2014-01-14 14:51:47 · 521 阅读 · 0 评论