Description
Input
Output
Sample Input
10 3 3 7 8 9 2 5
Sample Output
23
看懂了题目就是水题一道,因为要走最小的路程肯定是要将尽量多的重合的路一起走,这题的范围不大,直接暴力就行。
AC代码:
#include<iostream> #include<algorithm> #include<cstring> #include<string> #include<cstdio> #include<vector> #include<queue> using namespace std; #define T 1500 typedef long long ll; int main() { #ifdef zsc freopen("input.txt","r",stdin); #endif // zsc int n,m,i,j,k; int vis[T],x,y; while(~scanf("%d%d",&n,&m)) { memset(vis,0,sizeof(vis)); for(i=0;i<m;++i){ scanf("%d%d",&x,&y); for(j=x+1;j<=y;++j){ vis[j] |= 1; } } for(i=1,k=0;i<=n;++i){ if(vis[i]){ k++; } } printf("%d\n",(k<<1)+n+1); } return 0; }