# 数据结构中的无向图，用C语言实现的过程中的思路？？？

roblem Description
As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:

There is an undirected graph with n vertices and m edges. Then Yuta does q operations on this graph. Each operation is described by two integers L,R (1≤L≤R≤n) and can be split into three steps:

1. Delete all the edges which have at least one vertice outside the range [L,R].

2. Yuta wants you to tell him the number of connected component of the graph.

3. Restore the graph.

This task is too hard for Rikka to solve. Can you help her?

Input
There are at most 100 testcases and there are at least 97 testcases with n,m,q≤1000.

For each testcase, the first line contains three numbers n,m,q (n,q≤105,m≤2×105).

Then m lines follow. Each line contains two numbers ui,vi (1≤ui,vi≤105) which describe an edge of the graph.

Then q lines follows. Each line contains two numbers Li,Ri (1≤L≤R≤n) which describe an operation.

Output
For each operation you need print a single line with a single number - the answer of this operation.

Sample Input
3 3 2
1 2
1 3
2 3
1 2
1 3

Sample Output
2
1

• 写回答

#### 2条回答默认 最新

• threenewbee 2019-06-30 10:15
关注
本回答被题主选为最佳回答 , 对您是否有帮助呢?
评论

#### 悬赏问题

• ¥15 我知道什么是混合树，但是怎么写代码啊
• ¥50 开发板linux系统安装dpkg,apt函数库 有偿
• ¥15 浏览器时间循环 交互事件和延时事件的 优先级与执行问题
• ¥15 GD模块安装出错，libgd无法正常安装
• ¥20 求有缘人帮我把笛卡尔坐标系转换为经纬度 有偿
• ¥15 vue2中使用计算属性
• ¥50 远程桌面打开Mastercam、没有许可证、物理机打开正常
• ¥15 ubuntu安装gdal后java读取tif文件报错
• ¥15 请问lammps怎么做两种金属连接的原子浓度分布图
• ¥15 求jacquard数据集