CF367 E - Working routine
十字链表模拟#include
using namespace std;
int n,m,q;
struct Node{
int v; int d,r;
}ma[1005*1005];
int C(int x,int y){
return x*(m+1)+y;
}
int main(){
while(~scanf("%d %d %d",&n,&m,&q)) {
for(int i =
原创
2016-08-31 22:51:20 ·
460 阅读 ·
0 评论