1046. Shortest Distance (20)
来源:互联网 发布:淘宝充话费可以退款吗 编辑:程序博客网 时间:2024/05/22 09:03
点击打开链接
最后一个超时
#include <cstdio>#define MAX 100100int dis[MAX];int n;int main(){freopen("in.txt","r",stdin);scanf("%d",&n);for(int i=0;i<n;i++){scanf("%d",&dis[i]);}int m;scanf("%d",&m);for(int j=0;j<m;j++){int a,b;scanf("%d %d",&a,&b);a--;b--;int sp=0,ps=0;int i=a%n;while(1){if(i%n==b){break;} sp+=dis[i++];}i=a%n;while(1){i=(i+n-1)%n;ps+=dis[i];if(i%n==b){break;}}i=ps<sp?ps:sp;printf("%d\n",i);}return 0;}
0 0
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- 1046. Shortest Distance (20)
- oracle 存储过程
- SQL Server T-SQL高级查询
- windows开发笔记
- modelsim教程
- Android SDK开发包国内下载地址
- 1046. Shortest Distance (20)
- Axis2 生成 webService 的client端过程
- Android中Activity四种加载模式
- Android应用经典主界面框架之一:仿QQ (使用Fragment, 附源码)
- 用最基本的弗洛伊德算法求1到n的最短路径
- 下拉列表根据所选Item选中某个值
- Redis监控技巧
- 【ExtJS】图片编辑器imagefield
- 画直方图,自动色阶