1003. Emergency (25)
来源:互联网 发布:ubuntu只有guest用户 编辑:程序博客网 时间:2024/06/10 20:10
<span style="font-family: Arial, Helvetica, sans-serif;"></span><pre name="code" class="cpp"><span style="font-family: Arial, Helvetica, sans-serif;">1007. Maximum Subsequence Sum (25)Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1 <= i <= j <= K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.Input Specification:Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (<= 10000). The second line contains K numbers, separated by a space.Output Specification:For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.Sample Input:10-10 1 2 3 4 -5 -23 3 7 -21Sample Output:10 1 4</span>
<span style="font-family: Arial, Helvetica, sans-serif;"></span>
<span style="font-family: Arial, Helvetica, sans-serif;"></span>
<span style="font-family: Arial, Helvetica, sans-serif;"></span>
<span style="font-family: Arial, Helvetica, sans-serif;"></span><pre name="code" class="cpp">
using namespace std;#define MAX 100000int visited[501],map[1000][1000],d[501],team[501],path[501],call[501];int n,m,c1,c2,i;void shortestPath(int s,int t){int j;path[s]=1;call[s]=team[s];d[s]=0;while(true){int index=-1;int min=MAX;for(j=0;j<n;j++){if(!visited[j]&&d[j]<min){min=d[j];index=j;}}if(index!=-1){visited[index]=1;if(index==t) return;for(j=0;j<n;j++){if(map[index][j]==MAX||visited[j])continue;if(d[j]>d[index]+map[index][j]){d[j]=d[index]+map[index][j];call[j]=team[j]+call[index];path[j]=path[index];}elseif(d[j]==d[index]+map[index][j]){path[j]+=path[index];if(call[j]<team[j]+call[index])call[j]=team[j]+call[index];}}}elsereturn;}}int main(){cin>>n>>m>>c1>>c2;for(int p=0;p<n;p++)for(int q=0;q<n;q++)map[p][q]=MAX;for(i=0;i<n;i++){cin>>team[i];visited[i]=0;d[i]=MAX;path[i]=0;}for(i=0;i<m;i++){int a,b,c;cin>>a>>b>>c;if(map[a][b]>c)map[a][b]=map[b][a]=c;}shortestPath(c1,c2);cout<<path[c2]<<" "<<call[c2]<<endl;return 0;}
0 0
- 1003. Emergency (25)
- 1003. Emergency (25)-PAT
- (PAT)1003. Emergency (25)
- 1003. Emergency (25)
- 【C++】1003. Emergency (25)*
- 1003. Emergency (25)
- PAT 1003. Emergency (25)
- 1003. Emergency (25)
- 1003. Emergency (25)
- PAT 1003. Emergency (25)
- 1003. Emergency (25)
- 1003. Emergency (25)
- [PAT]1003. Emergency (25)
- 1003. Emergency (25)
- 1003. Emergency (25)
- 1003. Emergency (25)
- 1003. Emergency (25)
- 1003. Emergency (25)
- CoAP学习笔记——nodeJS node-coap安装和使用(Linux平台)
- linux系统 /var/log 详解
- fiddler学习笔记
- Windows 安装Calabash-Android
- 排序算法总结之希尔排序
- 1003. Emergency (25)
- C语言编译过程总结详解 - 链接方式
- Android应用程序打包时,出现错误:"XXX" is not translated in "af" (Afrikaans), "am" (Amharic), "ar" (Arabic).....
- VS2008程序的打包发布
- arm的LDMFD--4种堆栈方式
- 读取视频文件第一帧并显示
- Camel路由启动过程--续
- Linux 的多线程编程的高效开发经验
- 请问有统一给txt批量编号的文件吗