scy的技术博客

POJ 3255 #include <iostream> #include <string.h> #include <algorithm> #include <stdio.h> #include <stdlib.h> #include <vector> #include <queue> #include <a...

#include<cstdio> const int maxn = 50000+10; int p[maxn]; //存父节点 int r[maxn];//存与父节点的关系 0 同一类，1被父节点吃，2吃父节点 void set(int n) //初始化 { for(int x = 1; x <= n; x++) { p[x] = x; //开始自...

POJ：2431 P76 #include <stdio.h> #include<cstring> #include<algorithm> #include<queue> using namespace std; const int N=10000005; int main() { int L,P,N; int A[N]...

Lake Counting Time Limit: 1000MS Memory Limit: 65536K Description Due to recent rains, water has pooled in various places in Farmer John’s field, which is represented by a rectangle of N...

A+B Problem Time Limit: 1000MS Memory Limit: 65536K Description Saruman the White must lead his army along a straight path from Isengard to Helm’s Deep. To keep track of his forces, Saruman di...

A+B Problem **Time Limit:** 1000MS **Memory Limit:** 10000K **Total Submissions:** 498343 **Accepted:** 281415 Description Calculate a+b Input Two integer a,b (0<=a,b<=10) Output Output a+b Sa...